Recent Submissions

2024/07/24 07:36:12 norikame solved Problem0020 (Line: 12)
2024/07/24 07:28:53 norikame solved Problem0019 (Line: 6)
2024/07/24 07:26:27 norikame solved Problem0019 (Line: 7)
2024/07/24 07:14:36 norikame solved Problem0017 (Line: 2)
2024/07/24 07:12:55 norikame solved Problem0016 (Line: 1)
2024/07/24 05:10:15 norikame solved Problem0018 (Line: 7)
2024/07/23 18:07:31 norikame solved Problem0011 (Line: 11)
2024/07/23 18:01:52 norikame solved Problem0011 (Line: 12)
2024/07/23 17:57:14 norikame solved Problem0011 (Line: 14)
2024/07/23 17:32:54 norikame solved Problem0010 (Line: 7)
2024/07/21 16:24:37 Narikichi123 solved Problem0010 (Line: 8)
2024/07/21 16:16:26 Narikichi123 solved Problem0013 (Line: 14)
2024/07/18 15:51:46 omoioimo solved Problem0043 (Line: 15)
2024/07/15 18:28:10 hsfzbzjr solved Problem0003 (Line: 1)
2024/07/15 18:27:45 hsfzbzjr solved Problem0001 (Line: 1)
2024/07/12 21:09:45 Duke solved Problem0060 (Line: 27)
2024/07/12 20:56:15 Duke solved Problem0059 (Line: 12)
2024/07/12 20:30:29 Duke solved Problem0044 (Line: 7)
2024/07/12 18:46:06 untan solved Problem0039 (Line: 12)
2024/07/12 18:25:09 untan solved Problem0037 (Line: 8)
2024/07/12 18:24:13 untan solved Problem0036 (Line: 3)
2024/07/12 18:23:49 untan solved Problem0023 (Line: 6)
2024/07/12 18:21:38 untan solved Problem0025 (Line: 6)
2024/07/12 18:20:06 untan solved Problem0027 (Line: 11)
2024/07/12 18:15:30 untan solved Problem0035 (Line: 1)
2024/07/12 18:13:58 untan solved Problem0019 (Line: 5)
2024/07/12 18:13:46 untan solved Problem0019 (Line: 6)
2024/07/12 18:07:46 untan solved Problem0013 (Line: 12)
2024/07/12 17:58:25 untan solved Problem0018 (Line: 7)
2024/07/12 17:56:57 untan solved Problem0017 (Line: 2)
2024/07/12 17:55:48 untan solved Problem0016 (Line: 1)
2024/07/12 16:11:22 untan solved Problem0010 (Line: 7)
2024/07/12 16:10:15 untan solved Problem0009 (Line: 4)
2024/07/12 16:09:24 untan solved Problem0008 (Line: 3)
2024/07/12 16:08:44 untan solved Problem0007 (Line: 3)
2024/07/12 16:08:13 untan solved Problem0006 (Line: 3)
2024/07/12 16:07:43 untan solved Problem0005 (Line: 1)
2024/07/12 16:07:30 untan solved Problem0004 (Line: 3)
2024/07/12 16:07:14 untan solved Problem0003 (Line: 1)
2024/07/12 16:07:03 untan solved Problem0002 (Line: 1)
2024/07/12 16:06:35 untan solved Problem0001 (Line: 1)
2024/07/12 10:04:09 Duke solved Problem0076 (Line: 16)
2024/07/12 09:36:16 Duke solved Problem0040 (Line: 11)
2024/07/12 09:33:52 Duke solved Problem0039 (Line: 11)
2024/07/10 09:11:39 Duke solved Problem0057 (Line: 129)
2024/07/10 03:00:02 maple3142 solved Problem0085 (Line: 11)
2024/07/10 02:51:53 maple3142 solved Problem0080 (Line: 2)
2024/07/10 02:51:20 maple3142 solved Problem0080 (Line: 3)
2024/07/10 02:37:49 maple3142 solved Problem0019 (Line: 10)
2024/07/10 02:21:13 maple3142 solved Problem0023 (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.