Recent Submissions

2023/03/23 19:17:47 Register_int solved Problem0079 (Line: 4)
2023/03/22 22:41:06 ZebraCrossing solved Problem0042 (Line: 2)
2023/03/22 22:37:40 bilibilitdasc solved Problem0081 (Line: 8)
2023/03/22 21:22:25 frog_007 solved Problem0063 (Line: 3)
2023/03/22 17:46:01 zuytong solved Problem0061 (Line: 3)
2023/03/22 17:44:01 zuytong solved Problem0046 (Line: 13)
2023/03/22 17:39:42 zuytong solved Problem0043 (Line: 5)
2023/03/22 17:33:12 zuytong solved Problem0042 (Line: 2)
2023/03/22 17:30:49 zuytong solved Problem0036 (Line: 3)
2023/03/22 17:30:07 zuytong solved Problem0035 (Line: 1)
2023/03/22 17:29:33 zuytong solved Problem0023 (Line: 5)
2023/03/22 17:25:45 Kuma9825 solved Problem0009 (Line: 4)
2023/03/22 17:24:56 Kuma9825 solved Problem0008 (Line: 3)
2023/03/22 17:24:51 zuytong solved Problem0017 (Line: 4)
2023/03/22 17:24:32 Kuma9825 solved Problem0007 (Line: 3)
2023/03/22 17:24:11 Kuma9825 solved Problem0006 (Line: 3)
2023/03/22 17:23:53 Kuma9825 solved Problem0005 (Line: 1)
2023/03/22 17:23:43 Kuma9825 solved Problem0004 (Line: 3)
2023/03/22 17:23:29 Kuma9825 solved Problem0003 (Line: 1)
2023/03/22 17:23:13 Kuma9825 solved Problem0002 (Line: 1)
2023/03/22 17:22:50 Kuma9825 solved Problem0001 (Line: 1)
2023/03/22 17:21:22 zuytong solved Problem0016 (Line: 1)
2023/03/22 17:20:45 zuytong solved Problem0068 (Line: 3)
2023/03/22 17:16:51 zuytong solved Problem0063 (Line: 3)
2023/03/22 17:15:00 zuytong solved Problem0062 (Line: 2)
2023/03/22 17:13:37 zuytong solved Problem0069 (Line: 2)
2023/03/22 17:11:53 zuytong solved Problem0080 (Line: 2)
2023/03/22 17:10:24 zuytong solved Problem0052 (Line: 3)
2023/03/22 17:09:11 zuytong solved Problem0051 (Line: 3)
2023/03/22 17:08:32 zuytong solved Problem0050 (Line: 2)
2023/03/22 17:08:10 zuytong solved Problem0049 (Line: 1)
2023/03/22 17:07:57 zuytong solved Problem0049 (Line: 3)
2023/03/22 17:06:27 zuytong solved Problem0045 (Line: 1)
2023/03/22 17:05:52 zuytong solved Problem0028 (Line: 28)
2023/03/22 16:58:16 zuytong solved Problem0030 (Line: 20)
2023/03/22 16:57:38 zuytong solved Problem0031 (Line: 20)
2023/03/22 16:54:49 zuytong solved Problem0029 (Line: 20)
2023/03/22 16:45:04 zuytong solved Problem0025 (Line: 8)
2023/03/22 16:39:33 zuytong solved Problem0078 (Line: 1)
2023/03/22 16:37:26 zuytong solved Problem0019 (Line: 5)
2023/03/22 13:46:16 azazo solved Problem0019 (Line: 5)
2023/03/22 03:52:43 consecutivelimit solved Problem0058 (Line: 15)
2023/03/22 02:14:24 consecutivelimit solved Problem0029 (Line: 6)
2023/03/21 23:50:39 bilibilitdasc solved Problem0083 (Line: 17)
2023/03/21 23:48:37 bilibilitdasc solved Problem0071 (Line: 13)
2023/03/21 23:40:57 bilibilitdasc solved Problem0069 (Line: 2)
2023/03/21 23:20:02 frog_007 solved Problem0001 (Line: 1)
2023/03/21 23:02:24 frog_007 solved Problem0009 (Line: 4)
2023/03/21 22:40:16 xzggzh1 solved Problem0078 (Line: 1)
2023/03/21 22:39:30 xzggzh1 solved Problem0049 (Line: 1)

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.