Recent Submissions

2025/09/15 19:03:21 maxwell solved Problem0014 (Line: 12)
2025/09/15 18:37:16 ahi912 solved Problem0054 (Line: 39)
2025/09/15 16:41:52 maxwell solved Problem0051 (Line: 3)
2025/09/15 16:41:07 maxwell solved Problem0050 (Line: 2)
2025/09/15 16:38:27 maxwell solved Problem0049 (Line: 1)
2025/09/15 16:20:08 wlkz solved Problem0055 (Line: 35)
2025/09/15 16:17:59 maxwell solved Problem0053 (Line: 3)
2025/09/15 16:17:16 maxwell solved Problem0035 (Line: 1)
2025/09/15 16:16:51 maxwell solved Problem0017 (Line: 2)
2025/09/15 16:16:19 maxwell solved Problem0016 (Line: 1)
2025/09/15 16:15:35 maxwell solved Problem0008 (Line: 3)
2025/09/15 16:15:10 maxwell solved Problem0007 (Line: 3)
2025/09/15 16:14:32 maxwell solved Problem0006 (Line: 3)
2025/09/15 16:14:09 maxwell solved Problem0005 (Line: 1)
2025/09/15 16:13:56 maxwell solved Problem0004 (Line: 3)
2025/09/15 16:13:36 maxwell solved Problem0003 (Line: 1)
2025/09/15 16:13:19 maxwell solved Problem0002 (Line: 1)
2025/09/15 16:13:05 maxwell solved Problem0001 (Line: 1)
2025/09/15 15:31:05 Sijane_World solved Problem0001 (Line: 1)
2025/09/15 13:51:25 moying solved Problem0055 (Line: 35)
2025/09/15 13:50:02 Plausible1208 solved Problem0009 (Line: 4)
2025/09/15 13:48:20 Plausible1208 solved Problem0008 (Line: 3)
2025/09/15 13:11:53 ahi912 solved Problem0055 (Line: 32)
2025/09/15 13:05:28 uzuki solved Problem0001 (Line: 1)
2025/09/15 12:58:46 xxuurruuii solved Problem0055 (Line: 21)
2025/09/15 12:54:14 xxuurruuii solved Problem0055 (Line: 22)
2025/09/15 12:52:29 LeavingLeaves solved Problem0055 (Line: 14)
2025/09/15 12:33:40 Plausible1208 solved Problem0007 (Line: 3)
2025/09/15 12:32:43 Plausible1208 solved Problem0002 (Line: 1)
2025/09/15 12:32:02 Plausible1208 solved Problem0006 (Line: 3)
2025/09/15 12:31:06 Plausible1208 solved Problem0005 (Line: 1)
2025/09/15 12:29:06 LeavingLeaves solved Problem0055 (Line: 14)
2025/09/15 12:28:44 Plausible1208 solved Problem0004 (Line: 3)
2025/09/15 12:28:19 Plausible1208 solved Problem0003 (Line: 1)
2025/09/15 12:27:17 Plausible1208 solved Problem0002 (Line: 2)
2025/09/15 12:26:19 Plausible1208 solved Problem0001 (Line: 1)
2025/09/15 11:55:46 LeavingLeaves solved Problem0055 (Line: 23)
2025/09/15 11:48:36 uzuki solved Problem0055 (Line: 51)
2025/09/15 11:42:32 xxuurruuii solved Problem0055 (Line: 31)
2025/09/15 11:26:07 LeavingLeaves solved Problem0055 (Line: 31)
2025/09/15 11:20:35 LeavingLeaves solved Problem0055 (Line: 36)
2025/09/14 19:08:34 apeiro256 solved Problem0055 (Line: 58)
2025/09/12 02:11:23 apeiro256 solved Problem0024 (Line: 18)
2025/09/10 20:20:29 apeiro256 solved Problem0059 (Line: 18)
2025/09/10 20:20:10 apeiro256 solved Problem0059 (Line: 19)
2025/09/10 08:49:32 apeiro256 solved Problem0071 (Line: 13)
2025/09/10 08:45:08 apeiro256 solved Problem0028 (Line: 20)
2025/09/10 07:19:00 apeiro256 solved Problem0083 (Line: 27)
2025/09/10 01:13:08 apeiro256 solved Problem0015 (Line: 17)
2025/09/09 23:30:59 apeiro256 solved Problem0066 (Line: 10)

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.