Recent Submissions

2020/07/02 21:10:23 Yupiteru solved Problem0013 (Line: 7)
2020/07/02 21:06:06 Yupiteru solved Problem0013 (Line: 7)
2020/07/02 19:10:18 _misaki solved Problem0070 (Line: 8)
2020/07/02 19:08:35 _misaki solved Problem0070 (Line: 9)
2020/07/02 19:06:05 _misaki solved Problem0070 (Line: 10)
2020/07/02 19:02:31 _misaki solved Problem0070 (Line: 11)
2020/07/02 18:31:43 FF256grhy solved Problem0072 (Line: 14)
2020/07/02 18:22:08 FF256grhy solved Problem0072 (Line: 21)
2020/07/02 18:03:14 FF256grhy solved Problem0076 (Line: 43)
2020/07/02 15:30:19 _misaki solved Problem0071 (Line: 9)
2020/07/02 15:30:05 _misaki solved Problem0071 (Line: 10)
2020/07/02 12:00:50 akane solved Problem0024 (Line: 11)
2020/07/02 03:46:10 _misaki solved Problem0071 (Line: 10)
2020/07/02 03:25:29 _misaki solved Problem0066 (Line: 4)
2020/07/02 03:25:13 _misaki solved Problem0066 (Line: 4)
2020/07/02 02:48:22 _misaki solved Problem0066 (Line: 5)
2020/07/02 02:40:58 _misaki solved Problem0075 (Line: 11)
2020/07/02 02:39:02 _misaki solved Problem0066 (Line: 7)
2020/07/02 02:32:01 _misaki solved Problem0075 (Line: 11)
2020/07/02 02:30:42 _misaki solved Problem0075 (Line: 12)
2020/07/02 02:27:54 _misaki solved Problem0075 (Line: 12)
2020/07/02 02:27:13 _misaki solved Problem0075 (Line: 13)
2020/07/01 18:01:27 _misaki solved Problem0069 (Line: 2)
2020/07/01 13:37:40 penzant solved Problem0069 (Line: 3)
2020/07/01 10:47:53 akane solved Problem0036 (Line: 3)
2020/07/01 10:44:08 akane solved Problem0036 (Line: 3)
2020/06/30 19:44:02 nenecchi solved Problem0053 (Line: 6)
2020/06/30 15:30:17 Haa solved Problem0016 (Line: 1)
2020/06/30 15:29:31 Haa solved Problem0016 (Line: 9)
2020/06/30 13:26:22 _misaki solved Problem0075 (Line: 15)
2020/06/30 11:01:14 akane solved Problem0012 (Line: 11)
2020/06/30 11:00:11 akane solved Problem0012 (Line: 11)
2020/06/30 04:07:39 nenecchi solved Problem0012 (Line: 11)
2020/06/30 03:22:30 nenecchi solved Problem0011 (Line: 11)
2020/06/30 03:21:03 nenecchi solved Problem0011 (Line: 12)
2020/06/30 03:03:17 nenecchi solved Problem0010 (Line: 7)
2020/06/30 02:50:16 nenecchi solved Problem0009 (Line: 4)
2020/06/30 02:49:41 nenecchi solved Problem0009 (Line: 5)
2020/06/30 02:47:32 nenecchi solved Problem0008 (Line: 3)
2020/06/30 02:36:35 nenecchi solved Problem0007 (Line: 3)
2020/06/30 02:35:41 nenecchi solved Problem0006 (Line: 3)
2020/06/30 02:34:22 nenecchi solved Problem0005 (Line: 1)
2020/06/30 02:33:59 nenecchi solved Problem0004 (Line: 3)
2020/06/30 02:32:39 nenecchi solved Problem0003 (Line: 1)
2020/06/30 02:32:20 nenecchi solved Problem0002 (Line: 1)
2020/06/30 02:31:34 nenecchi solved Problem0001 (Line: 1)
2020/06/29 23:51:06 _misaki solved Problem0072 (Line: 8)
2020/06/29 14:36:24 gusmachine solved Problem0044 (Line: 6)
2020/06/29 14:34:12 gusmachine solved Problem0026 (Line: 9)
2020/06/29 13:30:09 akane solved Problem0013 (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.