Recent Submissions

2024/06/13 18:08:50 ToniB solved Problem0048 (Line: 4)
2024/06/13 15:01:40 omoioimo solved Problem0053 (Line: 3)
2024/06/13 14:41:03 omoioimo solved Problem0079 (Line: 5)
2024/06/13 09:10:36 ToniB solved Problem0025 (Line: 5)
2024/06/12 16:10:21 EOJ9mj solved Problem0005 (Line: 1)
2024/06/12 16:09:20 EOJ9mj solved Problem0004 (Line: 3)
2024/06/12 16:08:57 EOJ9mj solved Problem0003 (Line: 1)
2024/06/12 16:06:04 EOJ9mj solved Problem0007 (Line: 3)
2024/06/12 16:05:07 EOJ9mj solved Problem0006 (Line: 3)
2024/06/12 16:03:10 EOJ9mj solved Problem0002 (Line: 1)
2024/06/12 16:02:47 EOJ9mj solved Problem0001 (Line: 1)
2024/06/12 13:32:37 yoshykai solved Problem0044 (Line: 7)
2024/06/12 13:31:52 yoshykai solved Problem0026 (Line: 11)
2024/06/12 13:28:42 yoshykai solved Problem0026 (Line: 13)
2024/06/12 12:17:38 yoshykai solved Problem0064 (Line: 8)
2024/06/12 12:05:28 yoshykai solved Problem0043 (Line: 11)
2024/06/12 11:56:15 yoshykai solved Problem0044 (Line: 8)
2024/06/12 11:54:45 yoshykai solved Problem0044 (Line: 9)
2024/06/11 13:36:26 hos_lyric solved Problem0076 (Line: 13)
2024/06/11 13:35:58 hos_lyric solved Problem0076 (Line: 14)
2024/06/11 13:26:02 hos_lyric solved Problem0076 (Line: 14)
2024/06/11 13:01:34 hos_lyric solved Problem0073 (Line: 5)
2024/06/11 12:52:47 hos_lyric solved Problem0073 (Line: 6)
2024/06/11 12:36:19 hos_lyric solved Problem0073 (Line: 6)
2024/06/11 12:33:10 hos_lyric solved Problem0073 (Line: 7)
2024/06/11 12:29:40 hos_lyric solved Problem0073 (Line: 7)
2024/06/11 12:27:47 hos_lyric solved Problem0073 (Line: 8)
2024/06/11 11:31:57 yoshykai solved Problem0085 (Line: 9)
2024/06/11 11:29:45 yoshykai solved Problem0085 (Line: 10)
2024/06/11 11:27:01 yoshykai solved Problem0085 (Line: 11)
2024/06/11 01:59:45 schzna solved Problem0018 (Line: 7)
2024/06/10 19:34:11 schzna solved Problem0025 (Line: 5)
2024/06/10 15:51:45 Hinomishita solved Problem0058 (Line: 45)
2024/06/10 15:35:40 omoioimo solved Problem0048 (Line: 5)
2024/06/10 15:23:16 Hinomishita solved Problem0040 (Line: 13)
2024/06/10 15:19:04 omoioimo solved Problem0046 (Line: 7)
2024/06/10 15:13:13 omoioimo solved Problem0062 (Line: 2)
2024/06/10 15:10:12 omoioimo solved Problem0044 (Line: 15)
2024/06/10 14:58:40 omoioimo solved Problem0058 (Line: 45)
2024/06/10 14:48:15 omoioimo solved Problem0038 (Line: 6)
2024/06/09 09:55:09 iammartin solved Problem0085 (Line: 9)
2024/06/09 09:53:35 iammartin solved Problem0085 (Line: 11)
2024/06/09 09:51:17 iammartin solved Problem0036 (Line: 3)
2024/06/09 09:50:15 iammartin solved Problem0035 (Line: 1)
2024/06/09 09:47:05 iammartin solved Problem0079 (Line: 6)
2024/06/09 09:43:39 iammartin solved Problem0078 (Line: 1)
2024/06/09 09:42:48 iammartin solved Problem0063 (Line: 3)
2024/06/09 09:40:17 iammartin solved Problem0062 (Line: 2)
2024/06/09 09:34:03 iammartin solved Problem0053 (Line: 4)
2024/06/09 09:27:02 iammartin solved Problem0023 (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.