Recent Submissions

2025/09/30 15:40:46 maxwell solved Problem0024 (Line: 20)
2025/09/28 21:02:43 maxwell solved Problem0027 (Line: 10)
2025/09/28 20:55:51 maxwell solved Problem0027 (Line: 11)
2025/09/28 18:38:09 maxwell solved Problem0011 (Line: 11)
2025/09/28 16:41:51 maxwell solved Problem0011 (Line: 13)
2025/09/27 11:35:41 SchwarzeKatze9 solved Problem0018 (Line: 8)
2025/09/27 11:33:50 SchwarzeKatze9 solved Problem0018 (Line: 8)
2025/09/26 12:34:36 maxwell solved Problem0037 (Line: 6)
2025/09/26 12:32:06 maxwell solved Problem0037 (Line: 8)
2025/09/26 12:30:44 maxwell solved Problem0025 (Line: 5)
2025/09/26 12:24:04 maxwell solved Problem0023 (Line: 5)
2025/09/26 11:50:46 maxwell solved Problem0020 (Line: 12)
2025/09/26 11:23:02 maxwell solved Problem0018 (Line: 7)
2025/09/26 11:02:22 maxwell solved Problem0013 (Line: 10)
2025/09/26 09:23:01 SchwarzeKatze9 solved Problem0069 (Line: 2)
2025/09/26 09:03:58 SchwarzeKatze9 solved Problem0014 (Line: 9)
2025/09/26 08:55:14 SchwarzeKatze9 solved Problem0013 (Line: 7)
2025/09/26 08:46:35 SchwarzeKatze9 solved Problem0013 (Line: 9)
2025/09/26 08:30:36 SchwarzeKatze9 solved Problem0010 (Line: 6)
2025/09/25 16:11:43 SchwarzeKatze9 solved Problem0079 (Line: 5)
2025/09/25 16:03:35 SchwarzeKatze9 solved Problem0064 (Line: 9)
2025/09/25 15:59:41 SchwarzeKatze9 solved Problem0032 (Line: 10)
2025/09/25 15:50:53 SchwarzeKatze9 solved Problem0038 (Line: 5)
2025/09/25 15:47:57 SchwarzeKatze9 solved Problem0028 (Line: 19)
2025/09/25 15:43:11 maxwell solved Problem0009 (Line: 4)
2025/09/25 15:27:51 SchwarzeKatze9 solved Problem0053 (Line: 3)
2025/09/25 15:27:14 SchwarzeKatze9 solved Problem0037 (Line: 6)
2025/09/25 15:25:49 SchwarzeKatze9 solved Problem0037 (Line: 7)
2025/09/25 15:24:26 SchwarzeKatze9 solved Problem0025 (Line: 7)
2025/09/25 15:14:59 SchwarzeKatze9 solved Problem0020 (Line: 12)
2025/09/25 15:10:07 SchwarzeKatze9 solved Problem0048 (Line: 4)
2025/09/25 15:06:14 SchwarzeKatze9 solved Problem0046 (Line: 7)
2025/09/25 15:00:43 SchwarzeKatze9 solved Problem0023 (Line: 6)
2025/09/25 14:57:54 SchwarzeKatze9 solved Problem0019 (Line: 5)
2025/09/25 14:57:27 SchwarzeKatze9 solved Problem0019 (Line: 6)
2025/09/25 14:54:27 SchwarzeKatze9 solved Problem0019 (Line: 10)
2025/09/25 14:34:50 SchwarzeKatze9 solved Problem0063 (Line: 3)
2025/09/25 14:33:41 SchwarzeKatze9 solved Problem0052 (Line: 3)
2025/09/25 14:31:20 SchwarzeKatze9 solved Problem0051 (Line: 3)
2025/09/25 14:30:12 SchwarzeKatze9 solved Problem0036 (Line: 3)
2025/09/25 14:27:53 SchwarzeKatze9 solved Problem0080 (Line: 2)
2025/09/25 13:40:20 SchwarzeKatze9 solved Problem0069 (Line: 3)
2025/09/25 13:12:02 SchwarzeKatze9 solved Problem0062 (Line: 2)
2025/09/25 13:11:33 SchwarzeKatze9 solved Problem0061 (Line: 2)
2025/09/25 13:10:37 SchwarzeKatze9 solved Problem0050 (Line: 2)
2025/09/25 13:08:53 SchwarzeKatze9 solved Problem0078 (Line: 1)
2025/09/25 13:08:30 SchwarzeKatze9 solved Problem0049 (Line: 1)
2025/09/25 13:08:19 SchwarzeKatze9 solved Problem0045 (Line: 1)
2025/09/25 13:08:06 SchwarzeKatze9 solved Problem0035 (Line: 1)
2025/09/25 13:07:07 Windlotus solved Problem0040 (Line: 8)

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.