Recent Submissions

2025/07/14 18:42:26 Sky_Thunder solved Problem0019 (Line: 5)
2025/07/14 18:39:39 Sky_Thunder solved Problem0019 (Line: 10)
2025/07/14 17:00:56 Sky_Thunder solved Problem0011 (Line: 11)
2025/07/14 16:49:03 indium solved Problem0063 (Line: 3)
2025/07/14 16:48:03 Sky_Thunder solved Problem0063 (Line: 3)
2025/07/14 16:47:09 indium solved Problem0052 (Line: 3)
2025/07/14 16:46:07 Sky_Thunder solved Problem0052 (Line: 3)
2025/07/14 16:31:32 Sky_Thunder solved Problem0052 (Line: 9)
2025/07/14 16:21:38 indium solved Problem0051 (Line: 3)
2025/07/14 16:20:36 Sky_Thunder solved Problem0051 (Line: 3)
2025/07/14 16:05:48 Sky_Thunder solved Problem0036 (Line: 3)
2025/07/14 16:04:34 Sky_Thunder solved Problem0036 (Line: 3)
2025/07/14 15:58:42 indium solved Problem0036 (Line: 3)
2025/07/14 15:55:37 indium solved Problem0069 (Line: 2)
2025/07/14 15:51:24 Sky_Thunder solved Problem0069 (Line: 2)
2025/07/14 15:39:08 Sky_Thunder solved Problem0062 (Line: 2)
2025/07/14 15:37:32 indium solved Problem0062 (Line: 2)
2025/07/14 15:35:49 indium solved Problem0061 (Line: 2)
2025/07/14 15:34:50 Sky_Thunder solved Problem0061 (Line: 2)
2025/07/14 15:32:14 indium solved Problem0050 (Line: 2)
2025/07/14 15:27:37 Sky_Thunder solved Problem0050 (Line: 2)
2025/07/14 15:10:56 indium solved Problem0017 (Line: 2)
2025/07/14 15:09:49 indium solved Problem0078 (Line: 1)
2025/07/14 15:09:01 indium solved Problem0049 (Line: 1)
2025/07/14 15:08:10 Sky_Thunder solved Problem0078 (Line: 1)
2025/07/14 15:08:09 indium solved Problem0045 (Line: 1)
2025/07/14 15:07:47 indium solved Problem0035 (Line: 1)
2025/07/14 15:07:30 Sky_Thunder solved Problem0049 (Line: 1)
2025/07/14 15:07:06 Sky_Thunder solved Problem0045 (Line: 1)
2025/07/14 15:06:45 Sky_Thunder solved Problem0035 (Line: 1)
2025/07/14 15:06:28 indium solved Problem0016 (Line: 1)
2025/07/14 15:01:59 indium solved Problem0010 (Line: 6)
2025/07/14 14:57:22 indium solved Problem0010 (Line: 7)
2025/07/14 14:54:21 indium solved Problem0010 (Line: 9)
2025/07/14 14:53:06 Sky_Thunder solved Problem0010 (Line: 6)
2025/07/14 14:32:54 indium solved Problem0009 (Line: 4)
2025/07/14 14:32:24 Sky_Thunder solved Problem0009 (Line: 4)
2025/07/14 14:19:31 indium solved Problem0008 (Line: 3)
2025/07/14 14:16:58 indium solved Problem0007 (Line: 3)
2025/07/14 14:15:53 indium solved Problem0006 (Line: 3)
2025/07/14 14:13:24 indium solved Problem0005 (Line: 1)
2025/07/14 14:09:43 indium solved Problem0004 (Line: 3)
2025/07/14 14:08:53 indium solved Problem0003 (Line: 1)
2025/07/14 14:08:34 indium solved Problem0002 (Line: 1)
2025/07/14 14:08:02 indium solved Problem0001 (Line: 1)
2025/07/13 23:58:48 Yupiteru solved Problem0015 (Line: 7)
2025/07/13 22:52:52 yamake solved Problem0023 (Line: 6)
2025/07/13 22:51:02 yamake solved Problem0023 (Line: 6)
2025/07/13 22:42:20 Yupiteru solved Problem0015 (Line: 7)
2025/07/13 22:39:57 Yupiteru solved Problem0015 (Line: 7)

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.