Recent Submissions

2026/11/22 15:56:12 jess3jane solved Problem0026 (Line: 12)
2026/11/22 15:48:52 jess3jane solved Problem0025 (Line: 6)
2026/11/22 12:46:44 jess3jane solved Problem0023 (Line: 8)
2026/11/22 12:43:30 jess3jane solved Problem0020 (Line: 12)
2026/11/22 12:42:05 jess3jane solved Problem0019 (Line: 5)
2026/11/22 12:40:34 jess3jane solved Problem0017 (Line: 2)
2026/11/22 12:39:32 jess3jane solved Problem0016 (Line: 1)
2026/11/22 12:37:13 jess3jane solved Problem0018 (Line: 7)
2026/11/22 12:30:24 jess3jane solved Problem0014 (Line: 15)
2026/11/22 12:28:22 jess3jane solved Problem0013 (Line: 13)
2026/11/22 12:08:25 jess3jane solved Problem0011 (Line: 12)
2026/11/22 11:57:37 jess3jane solved Problem0010 (Line: 7)
2026/11/22 11:56:39 jess3jane solved Problem0010 (Line: 8)
2026/11/22 11:49:09 jess3jane solved Problem0009 (Line: 4)
2026/11/22 11:48:43 jess3jane solved Problem0009 (Line: 5)
2026/11/22 11:47:57 jess3jane solved Problem0008 (Line: 3)
2026/11/22 11:44:23 jess3jane solved Problem0007 (Line: 3)
2026/11/22 11:38:29 jess3jane solved Problem0006 (Line: 3)
2026/11/22 11:38:01 jess3jane solved Problem0005 (Line: 1)
2026/11/22 11:37:30 jess3jane solved Problem0004 (Line: 3)
2026/11/22 11:37:16 jess3jane solved Problem0003 (Line: 1)
2026/11/22 11:36:21 jess3jane solved Problem0002 (Line: 1)
2026/11/22 11:35:56 jess3jane solved Problem0001 (Line: 1)
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)

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.