Recent Submissions

2025/06/06 19:39:16 yao99 solved Problem0014 (Line: 8)
2025/06/06 19:31:47 yao99 solved Problem0013 (Line: 7)
2025/06/06 19:18:56 yao99 solved Problem0012 (Line: 11)
2025/06/06 19:14:45 yao99 solved Problem0011 (Line: 11)
2025/06/06 19:10:20 yao99 solved Problem0010 (Line: 6)
2025/06/06 19:02:14 yao99 solved Problem0009 (Line: 4)
2025/06/06 19:01:07 yao99 solved Problem0008 (Line: 3)
2025/06/06 19:00:24 yao99 solved Problem0007 (Line: 3)
2025/06/06 18:59:57 yao99 solved Problem0006 (Line: 3)
2025/06/06 18:59:32 yao99 solved Problem0005 (Line: 1)
2025/06/06 18:59:11 yao99 solved Problem0004 (Line: 3)
2025/06/06 18:58:03 yao99 solved Problem0003 (Line: 1)
2025/06/06 18:57:50 yao99 solved Problem0002 (Line: 1)
2025/06/06 18:56:42 yao99 solved Problem0001 (Line: 1)
2025/06/06 18:53:34 yao99 solved Problem0058 (Line: 15)
2025/06/06 18:04:21 CoconutIsNut solved Problem0010 (Line: 7)
2025/06/06 17:10:11 CoconutIsNut solved Problem0048 (Line: 5)
2025/06/06 17:02:03 CoconutIsNut solved Problem0048 (Line: 6)
2025/06/06 11:32:13 CainSnuke solved Problem0082 (Line: 12)
2025/06/06 11:24:45 CainSnuke solved Problem0084 (Line: 18)
2025/06/06 06:10:15 CoconutIsNut solved Problem0082 (Line: 16)
2025/06/06 05:58:07 CoconutIsNut solved Problem0048 (Line: 7)
2025/06/06 05:57:45 CoconutIsNut solved Problem0048 (Line: 8)
2025/06/06 05:42:55 CoconutIsNut solved Problem0069 (Line: 3)
2025/06/05 17:48:54 CoconutIsNut solved Problem0026 (Line: 10)
2025/06/05 17:43:39 CoconutIsNut solved Problem0044 (Line: 4)
2025/06/05 17:42:32 CoconutIsNut solved Problem0044 (Line: 5)
2025/06/05 17:15:09 CoconutIsNut solved Problem0042 (Line: 2)
2025/06/05 17:09:16 CoconutIsNut solved Problem0066 (Line: 10)
2025/06/05 16:57:39 CoconutIsNut solved Problem0042 (Line: 6)
2025/06/05 07:25:47 CoconutIsNut solved Problem0034 (Line: 5)
2025/06/05 07:25:11 CoconutIsNut solved Problem0034 (Line: 6)
2025/06/05 07:19:24 CoconutIsNut solved Problem0034 (Line: 6)
2025/06/05 07:16:35 CoconutIsNut solved Problem0025 (Line: 5)
2025/06/05 04:31:52 CoconutIsNut solved Problem0024 (Line: 11)
2025/06/05 04:23:07 CoconutIsNut solved Problem0023 (Line: 6)
2025/06/04 17:57:03 CoconutIsNut solved Problem0081 (Line: 8)
2025/06/04 17:46:36 CoconutIsNut solved Problem0081 (Line: 8)
2025/06/04 17:39:50 CoconutIsNut solved Problem0081 (Line: 8)
2025/06/04 17:10:55 CoconutIsNut solved Problem0065 (Line: 8)
2025/06/04 17:05:43 CoconutIsNut solved Problem0065 (Line: 9)
2025/06/04 16:39:22 CoconutIsNut solved Problem0041 (Line: 13)
2025/06/04 16:21:00 CoconutIsNut solved Problem0015 (Line: 8)
2025/06/04 14:13:56 CoconutIsNut solved Problem0040 (Line: 8)
2025/06/04 14:07:08 CoconutIsNut solved Problem0024 (Line: 17)
2025/06/04 14:03:24 CoconutIsNut solved Problem0024 (Line: 25)
2025/06/03 16:56:08 oiuoiuoiu solved Problem0013 (Line: 10)
2025/06/03 15:59:49 CoconutIsNut solved Problem0058 (Line: 26)
2025/06/03 15:55:16 CoconutIsNut solved Problem0058 (Line: 28)
2025/06/03 15:53:17 CoconutIsNut solved Problem0058 (Line: 31)

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.