Recent Submissions

2024/12/02 06:16:54 Nikkuniku029 solved Problem0009 (Line: 4)
2024/12/02 06:09:57 Nikkuniku029 solved Problem0008 (Line: 3)
2024/11/30 23:36:59 hardbank solved Problem0008 (Line: 3)
2024/11/30 23:33:28 hardbank solved Problem0004 (Line: 3)
2024/11/28 15:29:49 Aaa solved Problem0008 (Line: 3)
2024/11/27 17:37:56 qinyubo solved Problem0001 (Line: 1)
2024/11/27 13:48:03 chopper100 solved Problem0054 (Line: 21)
2024/11/26 21:05:52 oiuoiuoiu solved Problem0078 (Line: 1)
2024/11/26 21:04:55 oiuoiuoiu solved Problem0053 (Line: 4)
2024/11/26 21:02:33 oiuoiuoiu solved Problem0045 (Line: 1)
2024/11/26 21:01:42 oiuoiuoiu solved Problem0036 (Line: 3)
2024/11/26 21:00:36 oiuoiuoiu solved Problem0035 (Line: 1)
2024/11/26 20:59:41 oiuoiuoiu solved Problem0017 (Line: 2)
2024/11/26 20:58:46 oiuoiuoiu solved Problem0016 (Line: 1)
2024/11/26 20:48:52 oiuoiuoiu solved Problem0011 (Line: 11)
2024/11/26 20:42:12 oiuoiuoiu solved Problem0010 (Line: 6)
2024/11/26 20:41:59 oiuoiuoiu solved Problem0010 (Line: 6)
2024/11/21 19:28:52 chopper100 solved Problem0053 (Line: 3)
2024/11/21 19:25:09 chopper100 solved Problem0049 (Line: 1)
2024/11/21 19:23:35 chopper100 solved Problem0045 (Line: 1)
2024/11/21 19:22:55 chopper100 solved Problem0037 (Line: 8)
2024/11/21 19:21:44 chopper100 solved Problem0036 (Line: 3)
2024/11/21 19:21:02 chopper100 solved Problem0035 (Line: 1)
2024/11/21 19:19:36 chopper100 solved Problem0032 (Line: 8)
2024/11/21 19:09:39 chopper100 solved Problem0027 (Line: 10)
2024/11/21 19:02:26 chopper100 solved Problem0018 (Line: 7)
2024/11/21 18:59:57 chopper100 solved Problem0025 (Line: 6)
2024/11/20 18:45:45 souta_1326 solved Problem0054 (Line: 26)
2024/11/20 18:34:37 souta_1326 solved Problem0080 (Line: 2)
2024/11/20 18:28:42 souta_1326 solved Problem0010 (Line: 7)
2024/11/20 18:20:54 souta_1326 solved Problem0009 (Line: 4)
2024/11/20 18:19:23 souta_1326 solved Problem0008 (Line: 3)
2024/11/20 13:35:40 bazooka solved Problem0081 (Line: 10)
2024/11/20 13:26:27 bazooka solved Problem0080 (Line: 2)
2024/11/20 13:21:54 bazooka solved Problem0045 (Line: 1)
2024/11/20 13:21:39 bazooka solved Problem0045 (Line: 1)
2024/11/19 18:29:54 bazooka solved Problem0079 (Line: 5)
2024/11/19 18:27:17 bazooka solved Problem0078 (Line: 1)
2024/11/19 18:25:37 bazooka solved Problem0052 (Line: 4)
2024/11/19 17:59:06 bazooka solved Problem0066 (Line: 8)
2024/11/19 17:56:34 bazooka solved Problem0066 (Line: 8)
2024/11/19 17:06:24 bazooka solved Problem0065 (Line: 8)
2024/11/19 17:00:13 bazooka solved Problem0065 (Line: 9)
2024/11/19 16:58:06 bazooka solved Problem0064 (Line: 6)
2024/11/19 16:55:08 bazooka solved Problem0064 (Line: 8)
2024/11/19 16:52:40 bazooka solved Problem0064 (Line: 9)
2024/11/19 16:50:43 bazooka solved Problem0063 (Line: 3)
2024/11/19 16:48:53 bazooka solved Problem0062 (Line: 2)
2024/11/19 16:43:36 bazooka solved Problem0061 (Line: 2)
2024/11/19 16:37:21 bazooka solved Problem0046 (Line: 11)

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.