Recent Submissions

2025/08/31 14:29:07 AriharaNanami solved Problem0004 (Line: 3)
2025/08/31 14:28:43 AriharaNanami solved Problem0003 (Line: 1)
2025/08/31 14:28:31 AriharaNanami solved Problem0002 (Line: 1)
2025/08/31 14:28:11 AriharaNanami solved Problem0001 (Line: 1)
2025/08/31 13:39:12 Renthel solved Problem0037 (Line: 6)
2025/08/31 13:32:55 Renthel solved Problem0061 (Line: 2)
2025/08/31 13:31:14 Renthel solved Problem0050 (Line: 2)
2025/08/31 13:28:09 Renthel solved Problem0078 (Line: 1)
2025/08/31 13:27:32 Renthel solved Problem0049 (Line: 1)
2025/08/31 13:26:39 Renthel solved Problem0045 (Line: 1)
2025/08/31 13:21:02 Renthel solved Problem0022 (Line: 19)
2025/08/31 13:06:41 Renthel solved Problem0036 (Line: 3)
2025/08/31 13:05:25 Renthel solved Problem0025 (Line: 6)
2025/08/31 12:59:09 Renthel solved Problem0023 (Line: 6)
2025/08/31 12:50:55 Renthel solved Problem0023 (Line: 9)
2025/08/31 12:43:56 Renthel solved Problem0020 (Line: 12)
2025/08/31 12:09:11 Renthel solved Problem0035 (Line: 1)
2025/08/31 11:58:57 Renthel solved Problem0019 (Line: 5)
2025/08/31 11:58:30 Renthel solved Problem0019 (Line: 6)
2025/08/31 10:38:58 Renthel solved Problem0018 (Line: 7)
2025/08/31 10:35:32 Renthel solved Problem0018 (Line: 7)
2025/08/31 10:29:02 Renthel solved Problem0019 (Line: 10)
2025/08/31 10:20:56 Renthel solved Problem0011 (Line: 11)
2025/08/31 10:09:44 Renthel solved Problem0017 (Line: 2)
2025/08/30 15:49:23 Renthel solved Problem0016 (Line: 1)
2025/08/30 15:44:33 Renthel solved Problem0010 (Line: 8)
2025/08/30 15:40:32 Renthel solved Problem0010 (Line: 7)
2025/08/30 15:33:45 Renthel solved Problem0009 (Line: 4)
2025/08/30 15:31:24 Renthel solved Problem0008 (Line: 3)
2025/08/30 15:29:20 Renthel solved Problem0007 (Line: 3)
2025/08/30 15:28:19 Renthel solved Problem0006 (Line: 3)
2025/08/30 15:26:51 Renthel solved Problem0005 (Line: 1)
2025/08/30 15:25:40 Renthel solved Problem0004 (Line: 3)
2025/08/30 15:23:34 Renthel solved Problem0003 (Line: 1)
2025/08/30 15:22:49 Renthel solved Problem0002 (Line: 1)
2025/08/30 15:21:36 Renthel solved Problem0001 (Line: 1)
2025/08/30 15:20:37 Renthel solved Problem0001 (Line: 1)
2025/08/29 00:38:28 kei66go solved Problem0002 (Line: 1)
2025/08/29 00:36:58 kei66go solved Problem0001 (Line: 1)
2025/08/27 01:44:55 idiotcomputer solved Problem0014 (Line: 13)
2025/08/25 14:54:46 nanashi030 solved Problem0010 (Line: 7)
2025/08/25 14:46:55 nanashi030 solved Problem0009 (Line: 4)
2025/08/25 14:46:43 nanashi030 solved Problem0009 (Line: 4)
2025/08/25 14:43:47 nanashi030 solved Problem0008 (Line: 3)
2025/08/25 14:41:51 nanashi030 solved Problem0007 (Line: 3)
2025/08/25 14:26:33 nanashi030 solved Problem0006 (Line: 3)
2025/08/25 14:25:42 nanashi030 solved Problem0005 (Line: 1)
2025/08/25 14:25:12 nanashi030 solved Problem0004 (Line: 3)
2025/08/25 14:24:11 nanashi030 solved Problem0003 (Line: 1)
2025/08/25 14:23:40 nanashi030 solved Problem0002 (Line: 1)

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.