Recent Submissions

2025/07/19 06:50:16 inksamurai solved Problem0027 (Line: 9)
2025/07/19 05:37:25 inksamurai solved Problem0085 (Line: 9)
2025/07/18 19:11:12 kedec solved Problem0048 (Line: 7)
2025/07/18 18:51:22 kedec solved Problem0046 (Line: 7)
2025/07/18 18:50:24 kedec solved Problem0046 (Line: 8)
2025/07/18 18:48:22 kedec solved Problem0045 (Line: 1)
2025/07/18 18:48:02 kedec solved Problem0044 (Line: 4)
2025/07/18 18:46:43 kedec solved Problem0044 (Line: 5)
2025/07/18 18:11:18 kedec solved Problem0043 (Line: 7)
2025/07/18 18:11:05 kedec solved Problem0043 (Line: 7)
2025/07/18 18:10:43 kedec solved Problem0043 (Line: 7)
2025/07/18 18:09:20 kedec solved Problem0043 (Line: 7)
2025/07/18 18:01:02 kedec solved Problem0043 (Line: 7)
2025/07/18 18:00:43 kedec solved Problem0043 (Line: 9)
2025/07/18 18:00:09 kedec solved Problem0043 (Line: 7)
2025/07/18 17:55:37 kedec solved Problem0043 (Line: 8)
2025/07/18 17:47:31 kedec solved Problem0043 (Line: 9)
2025/07/18 17:35:28 kedec solved Problem0043 (Line: 10)
2025/07/18 17:24:20 kedec solved Problem0042 (Line: 2)
2025/07/18 17:15:02 kedec solved Problem0041 (Line: 6)
2025/07/18 17:03:14 kedec solved Problem0040 (Line: 5)
2025/07/18 17:00:18 kedec solved Problem0040 (Line: 6)
2025/07/18 16:57:34 Kenryuu3 solved Problem0010 (Line: 9)
2025/07/18 16:56:38 vingopro solved Problem0010 (Line: 6)
2025/07/18 16:56:00 kedec solved Problem0040 (Line: 6)
2025/07/18 16:46:40 kedec solved Problem0040 (Line: 11)
2025/07/18 16:46:35 Kenryuu3 solved Problem0009 (Line: 4)
2025/07/18 16:43:25 Kenryuu3 solved Problem0008 (Line: 3)
2025/07/18 16:40:13 kedec solved Problem0039 (Line: 4)
2025/07/18 16:38:39 kedec solved Problem0039 (Line: 11)
2025/07/18 16:34:54 Kenryuu3 solved Problem0007 (Line: 3)
2025/07/18 16:34:29 kedec solved Problem0041 (Line: 13)
2025/07/18 16:29:45 Kenryuu3 solved Problem0006 (Line: 3)
2025/07/18 16:28:10 Kenryuu3 solved Problem0005 (Line: 1)
2025/07/18 16:26:37 Kenryuu3 solved Problem0004 (Line: 3)
2025/07/18 16:25:12 Kenryuu3 solved Problem0003 (Line: 1)
2025/07/18 16:22:33 Kenryuu3 solved Problem0002 (Line: 1)
2025/07/18 16:16:06 indium solved Problem0012 (Line: 11)
2025/07/18 16:07:50 indium solved Problem0011 (Line: 11)
2025/07/18 13:28:52 Kenryuu3 solved Problem0001 (Line: 1)
2025/07/18 13:24:09 vingopro solved Problem0009 (Line: 4)
2025/07/18 12:33:23 kedec solved Problem0039 (Line: 4)
2025/07/18 11:24:06 kedec solved Problem0026 (Line: 7)
2025/07/18 11:15:54 kedec solved Problem0026 (Line: 8)
2025/07/18 11:01:57 kedec solved Problem0024 (Line: 8)
2025/07/18 10:38:39 kedec solved Problem0024 (Line: 17)
2025/07/18 10:35:41 kedec solved Problem0023 (Line: 5)
2025/07/18 10:28:41 kedec solved Problem0023 (Line: 6)
2025/07/18 10:26:52 kedec solved Problem0022 (Line: 8)
2025/07/18 10:26:39 kedec solved Problem0022 (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.