Recent Submissions

2021/04/08 05:59:03 SHIRAUME solved Problem0065 (Line: 13)
2021/04/08 05:43:04 SHIRAUME solved Problem0064 (Line: 7)
2021/04/08 05:39:18 SHIRAUME solved Problem0064 (Line: 8)
2021/04/08 05:29:59 SHIRAUME solved Problem0064 (Line: 9)
2021/04/08 05:25:46 SHIRAUME solved Problem0063 (Line: 3)
2021/04/08 05:22:22 SHIRAUME solved Problem0062 (Line: 2)
2021/04/08 05:21:24 SHIRAUME solved Problem0061 (Line: 2)
2021/04/06 13:56:32 ramdos solved Problem0069 (Line: 3)
2021/04/06 13:54:46 ramdos solved Problem0053 (Line: 3)
2021/04/05 10:28:41 SHIRAUME solved Problem0073 (Line: 15)
2021/04/05 09:17:23 SHIRAUME solved Problem0072 (Line: 22)
2021/04/04 13:07:03 sh_mug solved Problem0072 (Line: 10)
2021/04/02 09:55:01 SHIRAUME solved Problem0071 (Line: 9)
2021/04/02 09:50:06 SHIRAUME solved Problem0071 (Line: 10)
2021/04/02 09:39:58 SHIRAUME solved Problem0071 (Line: 10)
2021/04/02 09:37:32 SHIRAUME solved Problem0071 (Line: 12)
2021/04/02 09:16:46 SHIRAUME solved Problem0069 (Line: 2)
2021/04/02 09:02:12 SHIRAUME solved Problem0015 (Line: 12)
2021/04/02 08:51:13 SHIRAUME solved Problem0015 (Line: 16)
2021/04/02 07:36:54 SHIRAUME solved Problem0010 (Line: 7)
2021/04/02 00:02:42 SHIRAUME solved Problem0054 (Line: 21)
2021/04/01 23:43:35 SHIRAUME solved Problem0054 (Line: 26)
2021/04/01 23:37:58 SHIRAUME solved Problem0054 (Line: 26)
2021/04/01 23:35:25 SHIRAUME solved Problem0054 (Line: 24)
2021/04/01 23:23:04 SHIRAUME solved Problem0054 (Line: 25)
2021/04/01 23:08:28 SHIRAUME solved Problem0053 (Line: 3)
2021/04/01 23:07:29 SHIRAUME solved Problem0052 (Line: 3)
2021/04/01 23:05:59 SHIRAUME solved Problem0051 (Line: 3)
2021/04/01 23:04:28 SHIRAUME solved Problem0050 (Line: 2)
2021/04/01 22:59:39 SHIRAUME solved Problem0049 (Line: 1)
2021/04/01 22:54:26 SHIRAUME solved Problem0048 (Line: 5)
2021/04/01 22:42:51 SHIRAUME solved Problem0047 (Line: 19)
2021/04/01 22:26:53 SHIRAUME solved Problem0044 (Line: 4)
2021/04/01 22:23:05 SHIRAUME solved Problem0044 (Line: 5)
2021/04/01 22:19:31 SHIRAUME solved Problem0037 (Line: 6)
2021/04/01 16:12:19 SHIRAUME solved Problem0022 (Line: 12)
2021/04/01 10:37:06 SHIRAUME solved Problem0045 (Line: 1)
2021/04/01 10:33:09 SHIRAUME solved Problem0025 (Line: 5)
2021/04/01 10:28:37 SHIRAUME solved Problem0046 (Line: 7)
2021/04/01 06:27:29 SHIRAUME solved Problem0041 (Line: 6)
2021/04/01 06:26:34 SHIRAUME solved Problem0041 (Line: 7)
2021/04/01 06:14:06 SHIRAUME solved Problem0041 (Line: 13)
2021/04/01 06:04:58 SHIRAUME solved Problem0040 (Line: 9)
2021/04/01 06:00:15 SHIRAUME solved Problem0040 (Line: 10)
2021/04/01 05:59:20 SHIRAUME solved Problem0040 (Line: 10)
2021/04/01 05:50:24 SHIRAUME solved Problem0039 (Line: 7)
2021/04/01 05:48:40 SHIRAUME solved Problem0039 (Line: 8)
2021/04/01 05:44:15 SHIRAUME solved Problem0039 (Line: 9)
2021/04/01 05:40:36 SHIRAUME solved Problem0039 (Line: 11)
2021/04/01 05:29:50 SHIRAUME solved Problem0038 (Line: 5)

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.