Recent Submissions

2025/06/18 21:51:52 MIKI solved Problem0031 (Line: 17)
2025/06/18 21:51:40 MIKI solved Problem0030 (Line: 17)
2025/06/18 21:51:22 MIKI solved Problem0029 (Line: 17)
2025/06/18 21:50:25 MIKI solved Problem0024 (Line: 13)
2025/06/18 21:49:01 MIKI solved Problem0068 (Line: 5)
2025/06/18 21:48:10 MIKI solved Problem0047 (Line: 51)
2025/06/17 21:59:43 MIKI solved Problem0054 (Line: 25)
2025/06/17 21:59:11 MIKI solved Problem0043 (Line: 18)
2025/06/17 21:57:50 MIKI solved Problem0031 (Line: 18)
2025/06/17 21:57:28 MIKI solved Problem0030 (Line: 18)
2025/06/17 21:57:08 MIKI solved Problem0029 (Line: 18)
2025/06/17 21:55:45 MIKI solved Problem0026 (Line: 44)
2025/06/14 05:59:48 notDoizi solved Problem0065 (Line: 8)
2025/06/14 05:53:18 notDoizi solved Problem0064 (Line: 9)
2025/06/14 05:50:59 notDoizi solved Problem0063 (Line: 3)
2025/06/14 05:49:45 notDoizi solved Problem0062 (Line: 2)
2025/06/14 05:48:48 notDoizi solved Problem0061 (Line: 2)
2025/06/14 05:47:10 notDoizi solved Problem0052 (Line: 3)
2025/06/14 05:44:06 notDoizi solved Problem0051 (Line: 4)
2025/06/14 05:41:39 notDoizi solved Problem0050 (Line: 2)
2025/06/14 05:40:54 notDoizi solved Problem0049 (Line: 1)
2025/06/14 05:40:40 notDoizi solved Problem0045 (Line: 1)
2025/06/14 05:36:26 notDoizi solved Problem0037 (Line: 8)
2025/06/14 05:33:14 notDoizi solved Problem0036 (Line: 3)
2025/06/14 05:32:16 notDoizi solved Problem0035 (Line: 1)
2025/06/14 05:29:15 notDoizi solved Problem0032 (Line: 10)
2025/06/14 05:17:15 notDoizi solved Problem0027 (Line: 23)
2025/06/14 05:07:32 notDoizi solved Problem0026 (Line: 13)
2025/06/14 04:59:25 notDoizi solved Problem0025 (Line: 8)
2025/06/14 04:51:00 notDoizi solved Problem0024 (Line: 25)
2025/06/14 04:47:15 notDoizi solved Problem0023 (Line: 8)
2025/06/14 04:41:53 notDoizi solved Problem0020 (Line: 12)
2025/06/14 04:39:15 notDoizi solved Problem0019 (Line: 10)
2025/06/14 04:37:18 notDoizi solved Problem0018 (Line: 7)
2025/06/14 04:33:25 notDoizi solved Problem0017 (Line: 2)
2025/06/14 04:32:08 notDoizi solved Problem0016 (Line: 1)
2025/06/14 04:30:29 notDoizi solved Problem0015 (Line: 17)
2025/06/14 04:21:55 notDoizi solved Problem0013 (Line: 12)
2025/06/14 04:15:51 notDoizi solved Problem0012 (Line: 35)
2025/06/14 04:06:51 notDoizi solved Problem0011 (Line: 11)
2025/06/14 03:33:28 notDoizi solved Problem0069 (Line: 3)
2025/06/14 03:26:50 notDoizi solved Problem0053 (Line: 3)
2025/06/14 03:25:20 notDoizi solved Problem0053 (Line: 4)
2025/06/14 03:17:16 notDoizi solved Problem0084 (Line: 29)
2025/06/14 03:08:20 notDoizi solved Problem0083 (Line: 22)
2025/06/14 02:59:31 notDoizi solved Problem0085 (Line: 9)
2025/06/14 02:58:11 notDoizi solved Problem0085 (Line: 11)
2025/06/14 02:55:00 notDoizi solved Problem0085 (Line: 19)
2025/06/14 02:30:34 notDoizi solved Problem0010 (Line: 7)
2025/06/14 02:08:09 notDoizi solved Problem0009 (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.