Recent Submissions

2023/06/04 13:37:05 hoppii solved Problem0026 (Line: 25)
2023/06/04 13:12:32 hoppii solved Problem0015 (Line: 15)
2023/06/02 15:15:32 frog_007 solved Problem0053 (Line: 3)
2023/06/02 14:58:56 yoshykai solved Problem0047 (Line: 33)
2023/06/02 14:45:39 yoshykai solved Problem0043 (Line: 10)
2023/06/02 14:44:19 yoshykai solved Problem0043 (Line: 12)
2023/06/02 00:07:24 hoppii solved Problem0039 (Line: 9)
2023/06/01 14:51:20 mun solved Problem0030 (Line: 13)
2023/06/01 14:35:43 mun solved Problem0029 (Line: 9)
2023/06/01 14:25:04 mun solved Problem0029 (Line: 9)
2023/06/01 14:13:31 mun solved Problem0028 (Line: 20)
2023/06/01 13:47:35 Andycraft solved Problem0032 (Line: 10)
2023/06/01 13:40:42 Andycraft solved Problem0038 (Line: 5)
2023/06/01 13:37:25 Andycraft solved Problem0013 (Line: 12)
2023/06/01 13:33:51 Andycraft solved Problem0014 (Line: 15)
2023/06/01 13:28:36 Andycraft solved Problem0052 (Line: 9)
2023/06/01 13:26:38 Andycraft solved Problem0051 (Line: 4)
2023/06/01 13:25:29 Andycraft solved Problem0053 (Line: 5)
2023/06/01 13:22:38 Andycraft solved Problem0037 (Line: 8)
2023/06/01 13:21:56 Andycraft solved Problem0024 (Line: 25)
2023/06/01 13:17:48 Andycraft solved Problem0036 (Line: 3)
2023/06/01 13:16:39 Andycraft solved Problem0025 (Line: 6)
2023/06/01 13:15:28 Andycraft solved Problem0020 (Line: 12)
2023/06/01 13:13:59 Andycraft solved Problem0023 (Line: 8)
2023/06/01 13:02:35 mun solved Problem0012 (Line: 22)
2023/05/31 23:49:40 Andycraft solved Problem0018 (Line: 7)
2023/05/31 23:45:30 Andycraft solved Problem0019 (Line: 5)
2023/05/31 23:07:04 hoppii solved Problem0081 (Line: 9)
2023/05/31 22:56:43 hoppii solved Problem0046 (Line: 6)
2023/05/31 22:53:55 hoppii solved Problem0046 (Line: 7)
2023/05/31 22:25:39 hoppii solved Problem0013 (Line: 7)
2023/05/31 22:09:21 hoppii solved Problem0079 (Line: 4)
2023/05/31 14:15:11 yoshykai solved Problem0033 (Line: 17)
2023/05/31 14:13:48 Andycraft solved Problem0063 (Line: 3)
2023/05/31 14:12:39 Andycraft solved Problem0069 (Line: 3)
2023/05/31 14:11:47 Andycraft solved Problem0062 (Line: 2)
2023/05/31 14:10:54 Andycraft solved Problem0061 (Line: 2)
2023/05/31 14:09:56 Andycraft solved Problem0050 (Line: 2)
2023/05/31 14:05:55 yoshykai solved Problem0015 (Line: 15)
2023/05/31 14:05:20 yoshykai solved Problem0015 (Line: 16)
2023/05/31 14:01:44 Andycraft solved Problem0017 (Line: 2)
2023/05/31 14:01:05 Andycraft solved Problem0049 (Line: 1)
2023/05/31 14:00:48 Andycraft solved Problem0045 (Line: 1)
2023/05/31 14:00:33 Andycraft solved Problem0035 (Line: 1)
2023/05/31 14:00:07 Andycraft solved Problem0016 (Line: 1)
2023/05/31 13:59:44 Andycraft solved Problem0080 (Line: 2)
2023/05/31 13:58:55 Andycraft solved Problem0079 (Line: 5)
2023/05/31 13:57:28 Andycraft solved Problem0078 (Line: 1)
2023/05/31 13:51:02 Andycraft solved Problem0011 (Line: 13)
2023/05/31 13:36:33 Andycraft solved Problem0010 (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.