2020/09/30 18:12:44 i_have_no_name solved Problem0069 (Line: 2)
2020/09/30 10:44:05 akane solved Problem0067 (Line: 8)
2020/09/30 10:37:54 akane solved Problem0067 (Line: 8)
2020/09/29 12:24:28 akane solved Problem0054 (Line: 20)
2020/09/28 16:34:04 akane solved Problem0042 (Line: 2)
2020/09/28 15:10:44 akane solved Problem0019 (Line: 10)
2020/09/27 13:16:55 i_have_no_name solved Problem0015 (Line: 8)
2020/09/27 13:08:30 i_have_no_name solved Problem0015 (Line: 15)
2020/09/27 13:05:44 i_have_no_name solved Problem0014 (Line: 8)
2020/09/26 20:30:42 noneeeee solved Problem0027 (Line: 11)
2020/09/26 18:04:25 noneeeee solved Problem0046 (Line: 7)
2020/09/26 12:48:57 noneeeee solved Problem0069 (Line: 3)
2020/09/26 12:46:23 noneeeee solved Problem0063 (Line: 3)
2020/09/26 12:43:42 noneeeee solved Problem0062 (Line: 2)
2020/09/26 12:32:01 noneeeee solved Problem0061 (Line: 2)
2020/09/26 12:30:16 noneeeee solved Problem0053 (Line: 3)
2020/09/26 12:00:52 noneeeee solved Problem0052 (Line: 4)
2020/09/26 11:43:30 noneeeee solved Problem0051 (Line: 4)
2020/09/26 11:39:40 noneeeee solved Problem0050 (Line: 2)
2020/09/26 11:37:42 noneeeee solved Problem0049 (Line: 1)
2020/09/26 11:37:14 noneeeee solved Problem0045 (Line: 1)
2020/09/26 11:02:46 noneeeee solved Problem0036 (Line: 4)
2020/09/26 11:01:13 noneeeee solved Problem0035 (Line: 3)
2020/09/25 23:38:08 noneeeee solved Problem0026 (Line: 10)
2020/09/25 23:14:56 noneeeee solved Problem0022 (Line: 19)
2020/09/25 22:39:32 noneeeee solved Problem0024 (Line: 17)
2020/09/25 20:56:39 noneeeee solved Problem0023 (Line: 5)
2020/09/25 20:42:35 noneeeee solved Problem0020 (Line: 12)
2020/09/25 20:29:52 noneeeee solved Problem0019 (Line: 5)
2020/09/25 20:15:34 noneeeee solved Problem0018 (Line: 7)
2020/09/25 20:10:56 noneeeee solved Problem0016 (Line: 1)
2020/09/25 20:10:16 noneeeee solved Problem0017 (Line: 2)
2020/09/25 18:53:17 i_have_no_name solved Problem0063 (Line: 3)
2020/09/25 18:52:01 i_have_no_name solved Problem0052 (Line: 3)
2020/09/25 18:50:14 i_have_no_name solved Problem0051 (Line: 3)
2020/09/25 18:49:39 i_have_no_name solved Problem0036 (Line: 3)
2020/09/25 18:48:13 i_have_no_name solved Problem0062 (Line: 2)
2020/09/25 18:47:59 i_have_no_name solved Problem0061 (Line: 2)
2020/09/25 18:47:41 i_have_no_name solved Problem0050 (Line: 2)
2020/09/25 18:47:25 i_have_no_name solved Problem0042 (Line: 2)
2020/09/25 18:44:16 i_have_no_name solved Problem0035 (Line: 1)
2020/09/25 18:44:06 i_have_no_name solved Problem0049 (Line: 1)
2020/09/25 18:43:54 i_have_no_name solved Problem0045 (Line: 1)
2020/09/25 17:38:26 xvchenhao solved Problem0007 (Line: 3)
2020/09/25 17:30:52 xvchenhao solved Problem0006 (Line: 3)
2020/09/25 17:29:31 xvchenhao solved Problem0005 (Line: 1)
2020/09/25 17:23:58 xvchenhao solved Problem0003 (Line: 1)
2020/09/25 17:23:15 xvchenhao solved Problem0002 (Line: 1)
2020/09/25 17:22:39 xvchenhao solved Problem0001 (Line: 1)
2020/09/25 15:17:03 wo_okje solved Problem0036 (Line: 3)

• 2020/06/15 - Test Contest 2 is finished.
• 2020/06/02 - Tricky Contest is finished.
• 2020/05/18 - Mini Contest is finished.
• 2020/05/24 - MAO Contest 002 is finished.
• 2020/05/18 - Micro Contest is finished.
• 2020/05/14 - MAO Contest 001 is finished.
• 2020/05/09 - A+B Contest is finished
• 2020/05/07 - Test Contest is finished.
• 2020/05/07 - Length limit is changed from 150 to 500.
• 2020/05/06 - Hello, World!

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.