Recent Submissions

2020/09/23 12:01:36 akane solved Problem0066 (Line: 5)
2020/09/23 00:50:52 noneeeee solved Problem0032 (Line: 8)
2020/09/23 00:38:09 noneeeee solved Problem0025 (Line: 5)
2020/09/23 00:34:22 noneeeee solved Problem0025 (Line: 7)
2020/09/23 00:15:51 noneeeee solved Problem0010 (Line: 6)
2020/09/22 10:45:55 akane solved Problem0034 (Line: 6)
2020/09/22 10:44:45 akane solved Problem0034 (Line: 7)
2020/09/22 02:59:54 trasta solved Problem0001 (Line: 1)
2020/09/21 18:50:29 b23v solved Problem0007 (Line: 3)
2020/09/21 18:45:22 b23v solved Problem0006 (Line: 3)
2020/09/21 18:44:25 b23v solved Problem0005 (Line: 1)
2020/09/21 18:42:35 b23v solved Problem0004 (Line: 3)
2020/09/21 18:42:03 b23v solved Problem0003 (Line: 1)
2020/09/21 18:41:42 b23v solved Problem0002 (Line: 1)
2020/09/21 18:41:01 b23v solved Problem0001 (Line: 1)
2020/09/21 11:23:10 akane solved Problem0029 (Line: 11)
2020/09/20 15:18:08 ____ solved Problem0069 (Line: 3)
2020/09/20 15:14:01 ____ solved Problem0062 (Line: 2)
2020/09/20 15:13:05 ____ solved Problem0061 (Line: 2)
2020/09/20 15:12:36 ____ solved Problem0050 (Line: 2)
2020/09/20 15:12:02 ____ solved Problem0050 (Line: 2)
2020/09/20 15:03:21 ____ solved Problem0017 (Line: 2)
2020/09/20 15:02:50 ____ solved Problem0049 (Line: 1)
2020/09/20 15:02:39 ____ solved Problem0045 (Line: 1)
2020/09/20 15:02:23 ____ solved Problem0005 (Line: 1)
2020/09/20 15:02:11 ____ solved Problem0016 (Line: 1)
2020/09/20 15:01:59 ____ solved Problem0003 (Line: 1)
2020/09/20 15:01:45 ____ solved Problem0002 (Line: 1)
2020/09/20 15:01:34 ____ solved Problem0001 (Line: 1)
2020/09/20 15:01:12 ____ solved Problem0035 (Line: 1)
2020/09/20 14:35:52 i_have_no_name solved Problem0014 (Line: 14)
2020/09/20 14:23:50 noneeeee solved Problem0009 (Line: 4)
2020/09/20 14:22:48 i_have_no_name solved Problem0014 (Line: 19)
2020/09/20 14:12:42 noneeeee solved Problem0008 (Line: 3)
2020/09/20 13:49:55 i_have_no_name solved Problem0013 (Line: 7)
2020/09/20 13:49:21 noneeeee solved Problem0007 (Line: 3)
2020/09/20 13:42:21 noneeeee solved Problem0006 (Line: 3)
2020/09/20 13:38:07 noneeeee solved Problem0005 (Line: 1)
2020/09/20 13:36:49 noneeeee solved Problem0004 (Line: 3)
2020/09/20 13:31:29 noneeeee solved Problem0003 (Line: 1)
2020/09/20 13:28:08 noneeeee solved Problem0002 (Line: 1)
2020/09/20 13:27:06 noneeeee solved Problem0001 (Line: 1)
2020/09/20 09:32:22 i_have_no_name solved Problem0010 (Line: 8)
2020/09/20 09:18:16 i_have_no_name solved Problem0010 (Line: 6)
2020/09/20 09:15:18 i_have_no_name solved Problem0013 (Line: 11)
2020/09/20 09:13:31 i_have_no_name solved Problem0013 (Line: 13)
2020/09/20 09:07:08 i_have_no_name solved Problem0020 (Line: 12)
2020/09/20 09:01:56 i_have_no_name solved Problem0020 (Line: 13)
2020/09/20 08:54:56 i_have_no_name solved Problem0069 (Line: 3)
2020/09/20 08:53:24 i_have_no_name solved Problem0053 (Line: 3)

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.