Recent Submissions

2024/11/04 22:05:51 a9todo solved Problem0023 (Line: 5)
2024/11/04 19:16:28 blahajenjoyer_ solved Problem0051 (Line: 3)
2024/11/04 19:15:12 blahajenjoyer_ solved Problem0050 (Line: 2)
2024/11/04 19:14:33 blahajenjoyer_ solved Problem0049 (Line: 1)
2024/11/04 18:06:55 blahajenjoyer_ solved Problem0045 (Line: 1)
2024/11/04 12:35:28 chopper100 solved Problem0013 (Line: 9)
2024/11/04 08:07:37 a9todo solved Problem0023 (Line: 6)
2024/11/04 07:51:02 a9todo solved Problem0023 (Line: 7)
2024/11/02 04:01:09 a9todo solved Problem0022 (Line: 12)
2024/11/02 03:59:13 a9todo solved Problem0022 (Line: 13)
2024/11/01 12:43:20 a9todo solved Problem0020 (Line: 12)
2024/11/01 12:37:17 a9todo solved Problem0019 (Line: 5)
2024/11/01 12:36:30 a9todo solved Problem0019 (Line: 6)
2024/11/01 00:34:43 a9todo solved Problem0017 (Line: 2)
2024/10/31 22:46:48 PinkStreet solved Problem0063 (Line: 3)
2024/10/31 22:43:24 PinkStreet solved Problem0062 (Line: 2)
2024/10/31 22:43:06 PinkStreet solved Problem0061 (Line: 2)
2024/10/31 22:35:46 PinkStreet solved Problem0053 (Line: 25)
2024/10/31 22:29:38 PinkStreet solved Problem0053 (Line: 3)
2024/10/31 22:27:35 PinkStreet solved Problem0051 (Line: 3)
2024/10/31 22:26:08 PinkStreet solved Problem0050 (Line: 2)
2024/10/31 22:25:21 PinkStreet solved Problem0049 (Line: 1)
2024/10/31 22:21:19 PinkStreet solved Problem0038 (Line: 5)
2024/10/31 22:14:42 a9todo solved Problem0018 (Line: 7)
2024/10/31 22:11:26 PinkStreet solved Problem0045 (Line: 1)
2024/10/31 22:06:04 PinkStreet solved Problem0037 (Line: 6)
2024/10/31 22:03:15 PinkStreet solved Problem0036 (Line: 3)
2024/10/31 22:02:18 PinkStreet solved Problem0035 (Line: 1)
2024/10/31 21:13:16 a9todo solved Problem0018 (Line: 7)
2024/10/31 21:04:54 a9todo solved Problem0017 (Line: 2)
2024/10/31 21:02:43 a9todo solved Problem0017 (Line: 4)
2024/10/31 20:58:55 a9todo solved Problem0016 (Line: 1)
2024/10/31 20:41:53 a9todo solved Problem0015 (Line: 11)
2024/10/31 20:17:02 a9todo solved Problem0015 (Line: 12)
2024/10/31 16:57:35 chopper100 solved Problem0012 (Line: 11)
2024/10/31 16:47:23 chopper100 solved Problem0011 (Line: 11)
2024/10/31 16:38:32 chopper100 solved Problem0010 (Line: 6)
2024/10/31 10:16:42 chopper100 solved Problem0010 (Line: 6)
2024/10/30 18:06:13 chopper100 solved Problem0009 (Line: 4)
2024/10/30 18:04:05 chopper100 solved Problem0008 (Line: 3)
2024/10/30 18:02:37 chopper100 solved Problem0007 (Line: 3)
2024/10/30 18:01:51 chopper100 solved Problem0006 (Line: 3)
2024/10/30 18:01:11 chopper100 solved Problem0005 (Line: 1)
2024/10/30 18:00:07 chopper100 solved Problem0004 (Line: 3)
2024/10/30 17:58:55 chopper100 solved Problem0003 (Line: 1)
2024/10/30 17:58:03 chopper100 solved Problem0002 (Line: 1)
2024/10/30 17:57:37 chopper100 solved Problem0001 (Line: 1)
2024/10/30 02:12:24 a9todo solved Problem0015 (Line: 13)
2024/10/29 21:32:01 a9todo solved Problem0014 (Line: 8)
2024/10/29 05:00:59 a9todo solved Problem0014 (Line: 9)

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.