Recent Submissions

2023/09/21 16:45:10 Confringo solved Problem0020 (Line: 12)
2023/09/21 16:38:30 Confringo solved Problem0018 (Line: 7)
2023/09/21 16:32:40 Confringo solved Problem0019 (Line: 5)
2023/09/21 16:29:33 Confringo solved Problem0010 (Line: 7)
2023/09/21 16:27:13 Confringo solved Problem0009 (Line: 4)
2023/09/21 16:26:34 Confringo solved Problem0008 (Line: 3)
2023/09/21 16:25:47 Confringo solved Problem0007 (Line: 3)
2023/09/21 16:25:36 Confringo solved Problem0006 (Line: 3)
2023/09/21 16:25:12 Confringo solved Problem0005 (Line: 1)
2023/09/21 16:25:00 Confringo solved Problem0004 (Line: 3)
2023/09/21 16:24:44 Confringo solved Problem0003 (Line: 1)
2023/09/21 16:24:19 Confringo solved Problem0002 (Line: 1)
2023/09/21 16:24:08 Confringo solved Problem0001 (Line: 1)
2023/09/21 16:22:31 Confringo solved Problem0023 (Line: 6)
2023/09/21 16:21:08 Confringo solved Problem0019 (Line: 10)
2023/09/21 16:18:37 Confringo solved Problem0017 (Line: 2)
2023/09/21 16:17:23 Confringo solved Problem0016 (Line: 1)
2023/09/20 11:44:03 DateOfIssue solved Problem0016 (Line: 1)
2023/09/20 06:13:54 MiniTardigrade solved Problem0053 (Line: 3)
2023/09/20 06:11:39 MiniTardigrade solved Problem0023 (Line: 7)
2023/09/20 06:10:07 MiniTardigrade solved Problem0019 (Line: 5)
2023/09/20 06:09:16 MiniTardigrade solved Problem0017 (Line: 2)
2023/09/20 06:08:14 MiniTardigrade solved Problem0016 (Line: 1)
2023/09/20 06:06:56 MiniTardigrade solved Problem0012 (Line: 11)
2023/09/20 06:03:56 MiniTardigrade solved Problem0011 (Line: 11)
2023/09/20 05:58:04 MiniTardigrade solved Problem0010 (Line: 7)
2023/09/20 05:56:14 MiniTardigrade solved Problem0009 (Line: 4)
2023/09/20 05:55:29 MiniTardigrade solved Problem0008 (Line: 3)
2023/09/20 05:54:27 MiniTardigrade solved Problem0035 (Line: 1)
2023/09/20 05:21:00 MiniTardigrade solved Problem0007 (Line: 3)
2023/09/20 05:20:28 MiniTardigrade solved Problem0006 (Line: 3)
2023/09/20 05:20:04 MiniTardigrade solved Problem0005 (Line: 1)
2023/09/20 05:19:44 MiniTardigrade solved Problem0004 (Line: 3)
2023/09/20 05:19:25 MiniTardigrade solved Problem0003 (Line: 1)
2023/09/20 05:18:31 MiniTardigrade solved Problem0002 (Line: 1)
2023/09/20 05:18:13 MiniTardigrade solved Problem0001 (Line: 1)
2023/09/17 21:23:45 GUA_ solved Problem0001 (Line: 1)
2023/09/15 19:49:36 Yufang solved Problem0085 (Line: 11)
2023/09/14 06:06:09 vascularnumeral solved Problem0008 (Line: 3)
2023/09/14 06:04:43 vascularnumeral solved Problem0007 (Line: 3)
2023/09/14 06:02:55 vascularnumeral solved Problem0006 (Line: 3)
2023/09/14 06:01:51 vascularnumeral solved Problem0005 (Line: 1)
2023/09/14 06:01:19 vascularnumeral solved Problem0004 (Line: 3)
2023/09/14 06:00:53 vascularnumeral solved Problem0003 (Line: 1)
2023/09/14 06:00:13 vascularnumeral solved Problem0002 (Line: 1)
2023/09/14 05:59:53 vascularnumeral solved Problem0001 (Line: 1)
2023/09/11 03:19:26 ToniB solved Problem0079 (Line: 5)
2023/09/11 03:14:02 ToniB solved Problem0078 (Line: 1)
2023/09/11 00:27:28 ToniB solved Problem0080 (Line: 2)
2023/09/09 12:23:35 Scartstol solved Problem0010 (Line: 8)

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.