Recent Submissions

2021/10/16 16:55:16 LeavingLeaves solved Problem0023 (Line: 5)
2021/10/16 16:53:10 LeavingLeaves solved Problem0023 (Line: 6)
2021/10/16 16:10:27 LeavingLeaves solved Problem0022 (Line: 12)
2021/10/16 16:08:15 LeavingLeaves solved Problem0020 (Line: 12)
2021/10/16 16:06:28 LeavingLeaves solved Problem0019 (Line: 5)
2021/10/16 15:58:07 LeavingLeaves solved Problem0018 (Line: 7)
2021/10/16 15:57:08 LeavingLeaves solved Problem0017 (Line: 2)
2021/10/16 15:56:35 LeavingLeaves solved Problem0016 (Line: 1)
2021/10/16 15:38:34 LeavingLeaves solved Problem0015 (Line: 8)
2021/10/16 15:09:24 LeavingLeaves solved Problem0014 (Line: 8)
2021/10/16 14:56:54 LeavingLeaves solved Problem0013 (Line: 7)
2021/10/16 14:48:59 LeavingLeaves solved Problem0013 (Line: 9)
2021/10/16 14:42:43 LeavingLeaves solved Problem0012 (Line: 11)
2021/10/16 14:39:33 LeavingLeaves solved Problem0012 (Line: 12)
2021/10/16 14:33:01 LeavingLeaves solved Problem0011 (Line: 11)
2021/10/16 14:30:52 LeavingLeaves solved Problem0010 (Line: 6)
2021/10/16 00:14:33 LeavingLeaves solved Problem0010 (Line: 8)
2021/10/16 00:12:01 LeavingLeaves solved Problem0009 (Line: 4)
2021/10/16 00:11:21 LeavingLeaves solved Problem0008 (Line: 3)
2021/10/16 00:10:18 LeavingLeaves solved Problem0007 (Line: 3)
2021/10/16 00:09:14 LeavingLeaves solved Problem0006 (Line: 3)
2021/10/16 00:08:48 LeavingLeaves solved Problem0005 (Line: 1)
2021/10/16 00:08:19 LeavingLeaves solved Problem0004 (Line: 3)
2021/10/16 00:07:36 LeavingLeaves solved Problem0003 (Line: 1)
2021/10/16 00:07:13 LeavingLeaves solved Problem0002 (Line: 1)
2021/10/16 00:06:31 LeavingLeaves solved Problem0001 (Line: 1)
2021/10/15 20:50:03 woclass solved Problem0053 (Line: 4)
2021/10/15 20:45:01 woclass solved Problem0063 (Line: 3)
2021/10/15 20:39:07 woclass solved Problem0062 (Line: 2)
2021/10/15 20:38:10 woclass solved Problem0061 (Line: 2)
2021/10/15 20:30:31 woclass solved Problem0019 (Line: 5)
2021/10/15 20:18:03 woclass solved Problem0078 (Line: 1)
2021/10/15 20:17:45 woclass solved Problem0049 (Line: 1)
2021/10/15 20:17:27 woclass solved Problem0045 (Line: 1)
2021/10/15 20:13:13 woclass solved Problem0016 (Line: 1)
2021/10/15 18:42:43 woclass solved Problem0011 (Line: 11)
2021/10/15 18:24:51 woclass solved Problem0010 (Line: 8)
2021/10/15 18:09:32 woclass solved Problem0009 (Line: 4)
2021/10/15 18:00:04 woclass solved Problem0008 (Line: 3)
2021/10/15 17:56:04 woclass solved Problem0007 (Line: 4)
2021/10/15 17:53:25 woclass solved Problem0006 (Line: 3)
2021/10/15 17:52:20 woclass solved Problem0005 (Line: 1)
2021/10/15 17:51:48 woclass solved Problem0004 (Line: 3)
2021/10/15 17:51:06 woclass solved Problem0003 (Line: 1)
2021/10/15 17:50:43 woclass solved Problem0002 (Line: 1)
2021/10/15 17:49:41 woclass solved Problem0001 (Line: 1)
2021/10/15 17:24:10 kumjin3141 solved Problem0014 (Line: 11)
2021/10/15 17:02:06 kumjin3141 solved Problem0012 (Line: 11)
2021/10/15 16:42:44 kumjin3141 solved Problem0010 (Line: 7)
2021/10/15 16:33:36 shino16 solved Problem0018 (Line: 7)

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.