Recent Submissions

2026/11/18 02:01:02 Matt solved Problem0053 (Line: 3)
2026/11/18 01:51:20 Matt solved Problem0053 (Line: 3)
2026/11/18 01:49:20 Matt solved Problem0053 (Line: 4)
2026/11/18 01:39:52 Matt solved Problem0023 (Line: 5)
2026/11/18 00:59:25 Matt solved Problem0018 (Line: 7)
2026/11/18 00:50:46 Matt solved Problem0019 (Line: 5)
2026/11/18 00:48:27 Matt solved Problem0036 (Line: 3)
2026/11/17 12:48:51 Matt solved Problem0036 (Line: 3)
2026/11/17 12:46:23 Matt solved Problem0078 (Line: 1)
2026/11/17 12:45:27 Matt solved Problem0069 (Line: 2)
2026/11/17 12:37:51 Matt solved Problem0050 (Line: 2)
2026/11/17 12:36:16 Matt solved Problem0045 (Line: 1)
2026/11/17 12:25:57 Matt solved Problem0035 (Line: 1)
2026/11/17 12:24:46 Matt solved Problem0017 (Line: 2)
2026/11/17 12:24:08 Matt solved Problem0016 (Line: 1)
2026/11/17 12:15:26 Matt solved Problem0085 (Line: 9)
2026/11/17 12:02:01 Matt solved Problem0012 (Line: 11)
2026/11/17 11:53:15 Matt solved Problem0011 (Line: 11)
2026/11/17 11:38:50 Matt solved Problem0010 (Line: 6)
2026/11/17 11:03:36 Matt solved Problem0009 (Line: 4)
2026/11/17 10:47:53 Matt solved Problem0008 (Line: 3)
2026/11/17 10:36:58 Matt solved Problem0007 (Line: 3)
2026/11/17 10:34:54 Matt solved Problem0006 (Line: 3)
2026/11/17 10:32:40 Matt solved Problem0005 (Line: 1)
2026/11/17 10:30:41 Matt solved Problem0004 (Line: 3)
2026/11/17 10:28:58 Matt solved Problem0003 (Line: 1)
2026/11/17 10:28:38 Matt solved Problem0002 (Line: 1)
2026/11/17 10:27:44 Matt solved Problem0001 (Line: 1)
2026/11/17 10:27:31 Matt solved Problem0001 (Line: 1)
2026/11/16 18:15:04 hulgas solved Problem0044 (Line: 6)
2026/11/15 16:33:36 frugq solved Problem0007 (Line: 3)
2026/11/15 16:32:04 frugq solved Problem0006 (Line: 3)
2026/11/15 10:23:44 frugq solved Problem0004 (Line: 3)
2026/11/15 10:23:20 frugq solved Problem0003 (Line: 1)
2026/11/15 10:15:17 frugq solved Problem0002 (Line: 1)
2026/11/15 10:14:35 frugq solved Problem0001 (Line: 1)
2026/11/14 20:55:39 apeiro256 solved Problem0040 (Line: 12)
2026/11/14 04:23:05 Password7251 solved Problem0008 (Line: 3)
2026/11/14 03:59:50 Password7251 solved Problem0004 (Line: 3)
2026/11/14 03:59:35 Password7251 solved Problem0005 (Line: 1)
2026/11/14 03:59:25 Password7251 solved Problem0006 (Line: 3)
2026/11/14 03:58:58 Password7251 solved Problem0007 (Line: 3)
2026/11/14 03:57:36 Password7251 solved Problem0003 (Line: 1)
2026/11/14 03:57:20 Password7251 solved Problem0002 (Line: 1)
2026/11/14 03:56:59 Password7251 solved Problem0001 (Line: 1)
2026/11/12 18:03:14 Lazarus_hk416 solved Problem0033 (Line: 8)
2026/11/12 17:50:02 Lazarus_hk416 solved Problem0035 (Line: 1)
2026/11/12 17:45:14 Lazarus_hk416 solved Problem0069 (Line: 2)
2026/11/12 16:12:03 Lazarus_hk416 solved Problem0024 (Line: 17)
2026/11/12 15:59:48 Lazarus_hk416 solved Problem0023 (Line: 5)

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.