Recent Submissions

2025/09/18 19:42:15 LeavingLeaves solved Problem0043 (Line: 5)
2025/09/18 19:29:42 LeavingLeaves solved Problem0044 (Line: 4)
2025/09/18 18:04:02 Krain solved Problem0053 (Line: 3)
2025/09/18 18:01:43 LeavingLeaves solved Problem0040 (Line: 5)
2025/09/18 17:57:40 Krain solved Problem0019 (Line: 5)
2025/09/18 17:56:03 Krain solved Problem0014 (Line: 9)
2025/09/18 17:52:23 LeavingLeaves solved Problem0039 (Line: 4)
2025/09/18 17:52:09 Krain solved Problem0013 (Line: 8)
2025/09/18 17:48:56 LeavingLeaves solved Problem0033 (Line: 4)
2025/09/18 17:46:55 Krain solved Problem0063 (Line: 3)
2025/09/18 17:45:20 Krain solved Problem0062 (Line: 2)
2025/09/18 17:41:40 Krain solved Problem0061 (Line: 2)
2025/09/18 17:39:48 LeavingLeaves solved Problem0026 (Line: 7)
2025/09/18 17:39:16 Krain solved Problem0013 (Line: 10)
2025/09/18 17:28:31 uzuki solved Problem0011 (Line: 11)
2025/09/18 17:28:19 LeavingLeaves solved Problem0027 (Line: 7)
2025/09/18 17:25:37 Krain solved Problem0010 (Line: 7)
2025/09/18 17:20:32 Krain solved Problem0016 (Line: 1)
2025/09/18 17:20:31 LeavingLeaves solved Problem0027 (Line: 11)
2025/09/18 17:17:56 Krain solved Problem0011 (Line: 14)
2025/09/18 17:15:21 ahi912 solved Problem0045 (Line: 1)
2025/09/18 17:13:38 ahi912 solved Problem0001 (Line: 1)
2025/09/18 17:13:18 ahi912 solved Problem0003 (Line: 1)
2025/09/18 17:13:05 ahi912 solved Problem0002 (Line: 1)
2025/09/18 17:12:57 moying solved Problem0053 (Line: 3)
2025/09/18 17:12:36 uzuki solved Problem0006 (Line: 3)
2025/09/18 17:11:50 uzuki solved Problem0005 (Line: 1)
2025/09/18 17:11:08 maxwell solved Problem0078 (Line: 1)
2025/09/18 17:10:09 uzuki solved Problem0004 (Line: 3)
2025/09/18 17:09:45 uzuki solved Problem0003 (Line: 1)
2025/09/18 17:09:16 Krain solved Problem0009 (Line: 4)
2025/09/18 17:08:28 Krain solved Problem0008 (Line: 3)
2025/09/18 17:08:18 uzuki solved Problem0002 (Line: 1)
2025/09/18 17:06:05 Krain solved Problem0006 (Line: 3)
2025/09/18 17:05:14 Krain solved Problem0002 (Line: 1)
2025/09/18 17:04:45 Krain solved Problem0001 (Line: 1)
2025/09/18 17:01:01 ahi912 solved Problem0046 (Line: 7)
2025/09/18 17:00:50 LeavingLeaves solved Problem0046 (Line: 4)
2025/09/18 16:47:52 moying solved Problem0046 (Line: 8)
2025/09/18 16:43:41 maxwell solved Problem0046 (Line: 4)
2025/09/18 16:25:45 maxwell solved Problem0046 (Line: 5)
2025/09/18 15:11:10 Windlotus solved Problem0071 (Line: 18)
2025/09/18 15:04:35 Windlotus solved Problem0069 (Line: 3)
2025/09/18 14:55:56 Windlotus solved Problem0065 (Line: 8)
2025/09/18 14:54:23 Windlotus solved Problem0064 (Line: 9)
2025/09/18 14:51:31 Windlotus solved Problem0063 (Line: 3)
2025/09/18 14:51:16 Windlotus solved Problem0063 (Line: 4)
2025/09/18 14:47:17 Windlotus solved Problem0061 (Line: 2)
2025/09/18 14:44:51 Windlotus solved Problem0053 (Line: 3)
2025/09/18 14:43:54 Windlotus solved Problem0052 (Line: 4)

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.