Recent Submissions

2025/07/10 20:30:55 tidori solved Problem0016 (Line: 1)
2025/07/10 20:28:13 tidori solved Problem0016 (Line: 5)
2025/07/10 20:13:46 georeth solved Problem0020 (Line: 12)
2025/07/10 20:06:02 georeth solved Problem0019 (Line: 10)
2025/07/10 20:02:38 georeth solved Problem0018 (Line: 7)
2025/07/10 20:01:15 georeth solved Problem0017 (Line: 2)
2025/07/10 20:00:22 georeth solved Problem0016 (Line: 1)
2025/07/10 19:59:39 georeth solved Problem0015 (Line: 17)
2025/07/10 19:49:20 georeth solved Problem0014 (Line: 11)
2025/07/10 19:34:13 georeth solved Problem0013 (Line: 11)
2025/07/10 13:55:14 Sky_Thunder solved Problem0007 (Line: 3)
2025/07/10 13:50:41 Sky_Thunder solved Problem0006 (Line: 3)
2025/07/10 13:49:34 Sky_Thunder solved Problem0005 (Line: 1)
2025/07/10 13:39:52 Sky_Thunder solved Problem0004 (Line: 3)
2025/07/10 13:39:10 Sky_Thunder solved Problem0003 (Line: 1)
2025/07/10 13:38:25 Sky_Thunder solved Problem0002 (Line: 1)
2025/07/10 13:37:25 Sky_Thunder solved Problem0001 (Line: 1)
2025/07/09 16:23:05 tidori solved Problem0008 (Line: 3)
2025/07/09 16:21:27 tidori solved Problem0008 (Line: 4)
2025/07/09 16:17:16 tidori solved Problem0035 (Line: 1)
2025/07/09 16:16:50 tidori solved Problem0050 (Line: 2)
2025/07/09 16:16:04 tidori solved Problem0049 (Line: 1)
2025/07/09 16:09:14 tidori solved Problem0007 (Line: 3)
2025/07/09 16:08:13 tidori solved Problem0006 (Line: 3)
2025/07/09 16:07:27 tidori solved Problem0005 (Line: 1)
2025/07/09 16:06:57 tidori solved Problem0004 (Line: 3)
2025/07/09 16:06:08 tidori solved Problem0003 (Line: 1)
2025/07/09 16:04:35 tidori solved Problem0002 (Line: 1)
2025/07/09 16:03:39 tidori solved Problem0001 (Line: 1)
2025/07/07 17:58:44 idiotcomputer solved Problem0012 (Line: 11)
2025/07/07 17:44:03 idiotcomputer solved Problem0012 (Line: 14)
2025/07/07 17:39:28 idiotcomputer solved Problem0011 (Line: 11)
2025/07/07 17:34:03 idiotcomputer solved Problem0010 (Line: 6)
2025/07/07 17:16:11 idiotcomputer solved Problem0013 (Line: 9)
2025/07/07 09:49:19 idiotcomputer solved Problem0011 (Line: 12)
2025/07/06 20:53:15 idiotcomputer solved Problem0010 (Line: 7)
2025/07/06 20:49:40 idiotcomputer solved Problem0009 (Line: 4)
2025/07/06 20:49:11 idiotcomputer solved Problem0008 (Line: 3)
2025/07/06 20:48:15 idiotcomputer solved Problem0007 (Line: 3)
2025/07/06 20:47:44 idiotcomputer solved Problem0007 (Line: 5)
2025/07/06 20:46:31 idiotcomputer solved Problem0006 (Line: 3)
2025/07/06 20:45:50 idiotcomputer solved Problem0004 (Line: 3)
2025/07/06 20:45:30 idiotcomputer solved Problem0003 (Line: 1)
2025/07/06 20:45:18 idiotcomputer solved Problem0002 (Line: 1)
2025/07/06 20:45:05 idiotcomputer solved Problem0001 (Line: 1)
2025/07/06 20:44:22 idiotcomputer solved Problem0005 (Line: 1)
2025/07/06 18:41:28 hajimefug solved Problem0001 (Line: 1)
2025/07/02 23:08:04 doran solved Problem0010 (Line: 6)
2025/07/02 23:05:21 doran solved Problem0010 (Line: 7)
2025/07/02 22:59:13 doran solved Problem0008 (Line: 3)

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.