Recent Submissions

2021/01/20 21:28:40 yatabis solved Problem0026 (Line: 11)
2021/01/20 17:39:37 yatabis solved Problem0028 (Line: 20)
2021/01/20 17:26:07 yatabis solved Problem0027 (Line: 21)
2021/01/20 17:23:20 yatabis solved Problem0015 (Line: 18)
2021/01/20 14:32:05 yatabis solved Problem0022 (Line: 12)
2021/01/19 17:51:31 yatabis solved Problem0014 (Line: 9)
2021/01/17 15:01:03 shiomusubi496 solved Problem0032 (Line: 14)
2021/01/17 14:58:00 shiomusubi496 solved Problem0027 (Line: 15)
2021/01/17 14:54:07 shiomusubi496 solved Problem0024 (Line: 11)
2021/01/16 18:22:39 shiomusubi496 solved Problem0019 (Line: 5)
2021/01/16 17:51:11 shiomusubi496 solved Problem0011 (Line: 32)
2021/01/16 17:40:21 shiomusubi496 solved Problem0010 (Line: 7)
2021/01/16 17:37:14 shiomusubi496 solved Problem0009 (Line: 4)
2021/01/16 17:36:31 shiomusubi496 solved Problem0008 (Line: 3)
2021/01/16 17:35:12 shiomusubi496 solved Problem0007 (Line: 3)
2021/01/16 17:34:38 shiomusubi496 solved Problem0006 (Line: 3)
2021/01/16 17:34:10 shiomusubi496 solved Problem0005 (Line: 1)
2021/01/16 17:33:52 shiomusubi496 solved Problem0004 (Line: 3)
2021/01/16 17:33:32 shiomusubi496 solved Problem0003 (Line: 1)
2021/01/16 17:33:12 shiomusubi496 solved Problem0003 (Line: 2)
2021/01/16 17:32:35 shiomusubi496 solved Problem0002 (Line: 1)
2021/01/16 17:32:23 shiomusubi496 solved Problem0001 (Line: 1)
2021/01/13 15:32:01 yatabis solved Problem0052 (Line: 3)
2021/01/13 15:30:43 yatabis solved Problem0052 (Line: 4)
2021/01/13 15:29:22 yatabis solved Problem0051 (Line: 3)
2021/01/13 15:27:22 yatabis solved Problem0050 (Line: 2)
2021/01/13 15:26:39 yatabis solved Problem0049 (Line: 1)
2021/01/13 15:24:21 yatabis solved Problem0053 (Line: 3)
2021/01/13 15:20:19 yatabis solved Problem0010 (Line: 7)
2021/01/13 15:16:31 yatabis solved Problem0013 (Line: 17)
2021/01/13 15:01:27 yatabis solved Problem0012 (Line: 11)
2021/01/11 17:52:04 log solved Problem0008 (Line: 3)
2021/01/11 17:20:09 log solved Problem0007 (Line: 3)
2021/01/11 17:16:33 log solved Problem0006 (Line: 3)
2021/01/11 17:12:31 log solved Problem0005 (Line: 1)
2021/01/11 17:10:07 log solved Problem0004 (Line: 3)
2021/01/11 17:08:46 log solved Problem0003 (Line: 1)
2021/01/11 17:04:22 log solved Problem0002 (Line: 1)
2021/01/11 17:02:33 log solved Problem0001 (Line: 1)
2021/01/07 15:33:19 SSlime solved Problem0067 (Line: 7)
2021/01/07 15:32:30 SSlime solved Problem0067 (Line: 8)
2021/01/07 15:27:24 SSlime solved Problem0037 (Line: 6)
2021/01/07 15:26:49 SSlime solved Problem0037 (Line: 6)
2021/01/07 15:11:51 SSlime solved Problem0034 (Line: 6)
2021/01/07 14:54:52 SSlime solved Problem0015 (Line: 16)
2021/01/07 14:47:58 SSlime solved Problem0024 (Line: 11)
2021/01/07 14:41:15 SSlime solved Problem0014 (Line: 10)
2021/01/07 14:41:04 SSlime solved Problem0014 (Line: 10)
2021/01/02 18:25:40 yudai56 solved Problem0002 (Line: 1)
2021/01/02 18:23:24 yudai56 solved Problem0001 (Line: 1)

News

About

Markov Algorithm

quote from wikipedia:

The Rules is a sequence of pair of strings, usually presented in the form of pattern → replacement. Each rule may be either ordinary or terminating.

Given an input string:

  1. Check the Rules in order from top to bottom to see whether any of the patterns can be found in the input string.
  2. If none is found, the algorithm stops.
  3. If one (or more) is found, use the first of them to replace the leftmost occurrence of matched text in the input string with its replacement. If the rule just applied was a terminating one, the algorithm stops.
  4. Go to step 1.

Note that after each rule application the search starts over from the first rule.

Syntax and Limitations

pattern:replacement This is ordinary rule. Replace first occurrence of pattern to replacement.
pattern::replacement This is terminating rule. Replace first occurrence of pattern to replacement and the algorithm stops.
empty pattern Empty string matches to the beginning of a string.
comments Lines not containing : are regarded as comments.
spaces Leading/trailing spaces in pattern/replacement are ignored.
step limit The number of replacements must not 50000 times.
string length limit The length of input string must not exceed 500 at any moment.
code length limit The length of the code must not exceed 1000 including comments and blanks.

Specifications

  • Your code will be accepted if it runs correctly for all testcases prepared by the problem writer.
  • The score is calculated based on the number of lines of replacement rules.
  • Scoring formula is min(900*Best / Yours + 100, 1000).
  • The fastest player who solved in fewest lines becomes Top player.
  • However the writer cannot become Top player and his/her solution isn't applied to Best.
  • Testcase hack is not allowed. If I find it, I will edit testcases and run rejudge.