Recent Submissions

2025/06/30 11:44:40 CoconutIsNut solved Problem0073 (Line: 7)
2025/06/30 09:47:27 CoconutIsNut solved Problem0075 (Line: 19)
2025/06/30 09:36:08 CoconutIsNut solved Problem0075 (Line: 24)
2025/06/30 09:25:24 CoconutIsNut solved Problem0084 (Line: 8)
2025/06/30 09:25:11 CoconutIsNut solved Problem0083 (Line: 8)
2025/06/30 09:24:49 CoconutIsNut solved Problem0083 (Line: 8)
2025/06/29 16:12:26 CoconutIsNut solved Problem0027 (Line: 7)
2025/06/29 16:00:19 CoconutIsNut solved Problem0077 (Line: 14)
2025/06/29 15:46:36 CoconutIsNut solved Problem0073 (Line: 8)
2025/06/29 15:38:31 CoconutIsNut solved Problem0083 (Line: 8)
2025/06/29 15:34:48 CoconutIsNut solved Problem0084 (Line: 9)
2025/06/29 15:34:36 CoconutIsNut solved Problem0083 (Line: 9)
2025/06/29 15:34:24 CoconutIsNut solved Problem0083 (Line: 9)
2025/06/29 15:33:37 CoconutIsNut solved Problem0083 (Line: 9)
2025/06/29 15:33:17 CoconutIsNut solved Problem0083 (Line: 9)
2025/06/29 15:32:39 CoconutIsNut solved Problem0083 (Line: 9)
2025/06/29 15:32:04 CoconutIsNut solved Problem0083 (Line: 9)
2025/06/29 15:31:46 CoconutIsNut solved Problem0084 (Line: 10)
2025/06/29 15:31:25 CoconutIsNut solved Problem0083 (Line: 9)
2025/06/29 15:30:44 CoconutIsNut solved Problem0083 (Line: 9)
2025/06/29 15:30:02 doran solved Problem0012 (Line: 32)
2025/06/29 15:26:40 CoconutIsNut solved Problem0084 (Line: 11)
2025/06/29 15:26:01 CoconutIsNut solved Problem0083 (Line: 11)
2025/06/29 15:10:58 CoconutIsNut solved Problem0084 (Line: 13)
2025/06/29 15:08:56 CoconutIsNut solved Problem0083 (Line: 12)
2025/06/29 15:06:19 CoconutIsNut solved Problem0084 (Line: 14)
2025/06/29 15:02:03 doran solved Problem0011 (Line: 22)
2025/06/29 14:54:45 CoconutIsNut solved Problem0083 (Line: 12)
2025/06/29 14:54:28 CoconutIsNut solved Problem0083 (Line: 13)
2025/06/29 14:49:57 CoconutIsNut solved Problem0083 (Line: 13)
2025/06/29 09:32:59 doran solved Problem0010 (Line: 7)
2025/06/29 09:32:14 doran solved Problem0010 (Line: 7)
2025/06/29 09:24:13 doran solved Problem0009 (Line: 4)
2025/06/29 09:22:25 doran solved Problem0008 (Line: 3)
2025/06/29 09:07:36 doran solved Problem0007 (Line: 3)
2025/06/29 09:06:13 doran solved Problem0006 (Line: 3)
2025/06/29 09:05:41 doran solved Problem0005 (Line: 1)
2025/06/29 09:03:52 doran solved Problem0004 (Line: 3)
2025/06/29 09:03:20 doran solved Problem0003 (Line: 1)
2025/06/29 09:02:59 doran solved Problem0002 (Line: 1)
2025/06/29 09:01:53 doran solved Problem0001 (Line: 1)
2025/06/29 09:00:34 doran solved Problem0001 (Line: 1)
2025/06/29 06:40:08 CoconutIsNut solved Problem0074 (Line: 4)
2025/06/29 06:34:49 CoconutIsNut solved Problem0068 (Line: 3)
2025/06/29 06:21:59 CoconutIsNut solved Problem0067 (Line: 7)
2025/06/29 06:16:19 CoconutIsNut solved Problem0064 (Line: 6)
2025/06/29 06:11:44 CoconutIsNut solved Problem0083 (Line: 19)
2025/06/29 06:05:00 CoconutIsNut solved Problem0058 (Line: 14)
2025/06/26 00:18:04 tmep solved Problem0061 (Line: 2)
2025/06/26 00:12:11 tmep solved Problem0069 (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.