Recent Submissions

2021/07/24 00:24:10 shananton solved Problem0039 (Line: 15)
2021/07/24 00:04:56 LightningSB solved Problem0037 (Line: 8)
2021/07/23 23:57:26 shananton solved Problem0085 (Line: 9)
2021/07/23 23:51:36 shananton solved Problem0081 (Line: 8)
2021/07/23 23:38:20 shananton solved Problem0026 (Line: 12)
2021/07/23 23:29:50 shananton solved Problem0015 (Line: 15)
2021/07/22 16:01:04 garymimi0303 solved Problem0080 (Line: 2)
2021/07/22 15:58:02 AzusaCat solved Problem0037 (Line: 6)
2021/07/22 15:53:57 garymimi0303 solved Problem0019 (Line: 5)
2021/07/22 15:47:14 garymimi0303 solved Problem0058 (Line: 45)
2021/07/22 10:31:32 imalyd solved Problem0079 (Line: 5)
2021/07/22 10:29:55 imalyd solved Problem0078 (Line: 1)
2021/07/22 10:25:45 imalyd solved Problem0064 (Line: 8)
2021/07/22 10:24:06 imalyd solved Problem0063 (Line: 3)
2021/07/22 10:22:35 imalyd solved Problem0062 (Line: 2)
2021/07/22 10:21:23 imalyd solved Problem0053 (Line: 3)
2021/07/22 10:18:52 imalyd solved Problem0038 (Line: 10)
2021/07/22 10:14:00 imalyd solved Problem0036 (Line: 3)
2021/07/22 10:13:35 imalyd solved Problem0035 (Line: 1)
2021/07/22 10:10:43 imalyd solved Problem0023 (Line: 5)
2021/07/22 10:08:38 imalyd solved Problem0020 (Line: 12)
2021/07/22 10:06:08 imalyd solved Problem0018 (Line: 7)
2021/07/22 10:05:21 imalyd solved Problem0017 (Line: 2)
2021/07/22 10:04:42 imalyd solved Problem0016 (Line: 1)
2021/07/22 10:00:38 imalyd solved Problem0085 (Line: 9)
2021/07/22 09:59:36 imalyd solved Problem0085 (Line: 11)
2021/07/22 09:58:34 imalyd solved Problem0085 (Line: 13)
2021/07/21 22:40:32 emofunc solved Problem0017 (Line: 2)
2021/07/21 22:38:51 emofunc solved Problem0016 (Line: 1)
2021/07/21 22:28:45 emofunc solved Problem0008 (Line: 3)
2021/07/21 22:27:49 emofunc solved Problem0007 (Line: 3)
2021/07/21 22:26:47 emofunc solved Problem0006 (Line: 3)
2021/07/21 22:25:05 emofunc solved Problem0005 (Line: 1)
2021/07/21 22:24:08 emofunc solved Problem0004 (Line: 3)
2021/07/21 22:23:02 emofunc solved Problem0003 (Line: 1)
2021/07/21 22:21:58 emofunc solved Problem0002 (Line: 1)
2021/07/21 22:20:30 playf solved Problem0009 (Line: 4)
2021/07/21 22:20:25 emofunc solved Problem0001 (Line: 1)
2021/07/21 22:18:13 emofunc solved Problem0009 (Line: 4)
2021/07/21 18:54:18 garymimi0303 solved Problem0053 (Line: 3)
2021/07/21 18:53:03 garymimi0303 solved Problem0052 (Line: 3)
2021/07/21 18:52:20 garymimi0303 solved Problem0051 (Line: 3)
2021/07/21 18:51:46 garymimi0303 solved Problem0050 (Line: 2)
2021/07/21 18:30:24 garymimi0303 solved Problem0049 (Line: 1)
2021/07/21 18:19:14 garymimi0303 solved Problem0046 (Line: 4)
2021/07/21 18:03:15 garymimi0303 solved Problem0045 (Line: 1)
2021/07/21 17:58:41 garymimi0303 solved Problem0042 (Line: 2)
2021/07/21 17:58:33 juju527 solved Problem0062 (Line: 2)
2021/07/21 17:56:32 juju527 solved Problem0061 (Line: 2)
2021/07/21 17:49:30 juju527 solved Problem0050 (Line: 3)

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.