Recent Submissions

2025/10/24 09:46:12 fbwlekfbhlewkhfb solved Problem0010 (Line: 7)
2025/10/24 09:38:31 fbwlekfbhlewkhfb solved Problem0009 (Line: 4)
2025/10/24 09:33:14 fbwlekfbhlewkhfb solved Problem0008 (Line: 3)
2025/10/24 09:13:55 fbwlekfbhlewkhfb solved Problem0007 (Line: 3)
2025/10/24 09:07:16 fbwlekfbhlewkhfb solved Problem0006 (Line: 3)
2025/10/24 09:00:49 fbwlekfbhlewkhfb solved Problem0005 (Line: 1)
2025/10/24 08:56:35 fbwlekfbhlewkhfb solved Problem0004 (Line: 3)
2025/10/24 08:55:41 fbwlekfbhlewkhfb solved Problem0003 (Line: 1)
2025/10/24 08:53:54 fbwlekfbhlewkhfb solved Problem0002 (Line: 1)
2025/10/24 08:51:38 fbwlekfbhlewkhfb solved Problem0001 (Line: 1)
2025/10/24 03:17:43 AlexSozz solved Problem0010 (Line: 16)
2025/10/24 00:23:25 ks solved Problem0010 (Line: 7)
2025/10/24 00:17:33 ks solved Problem0009 (Line: 4)
2025/10/24 00:15:35 ks solved Problem0008 (Line: 3)
2025/10/24 00:05:44 ks solved Problem0008 (Line: 4)
2025/10/24 00:01:50 ks solved Problem0007 (Line: 3)
2025/10/24 00:01:16 ks solved Problem0007 (Line: 4)
2025/10/23 23:56:32 ks solved Problem0006 (Line: 3)
2025/10/23 23:55:35 ks solved Problem0005 (Line: 1)
2025/10/23 23:55:06 ks solved Problem0004 (Line: 3)
2025/10/23 23:54:00 ks solved Problem0003 (Line: 1)
2025/10/23 23:51:33 ks solved Problem0002 (Line: 1)
2025/10/23 23:50:51 ks solved Problem0001 (Line: 1)
2025/10/23 22:05:09 Ant2357 solved Problem0006 (Line: 3)
2025/10/23 21:32:54 Ant2357 solved Problem0019 (Line: 10)
2025/10/23 21:24:34 Ant2357 solved Problem0001 (Line: 2)
2025/10/23 06:39:29 AlexSozz solved Problem0009 (Line: 5)
2025/10/23 03:29:47 AlexSozz solved Problem0008 (Line: 3)
2025/10/23 03:12:43 bdolson solved Problem0081 (Line: 7)
2025/10/23 03:10:21 bdolson solved Problem0053 (Line: 3)
2025/10/23 00:29:24 bdolson solved Problem0023 (Line: 7)
2025/10/23 00:21:33 bdolson solved Problem0063 (Line: 3)
2025/10/22 22:36:53 bdolson solved Problem0051 (Line: 3)
2025/10/22 22:36:15 bdolson solved Problem0036 (Line: 3)
2025/10/22 22:34:18 bdolson solved Problem0080 (Line: 2)
2025/10/22 22:32:37 bdolson solved Problem0069 (Line: 3)
2025/10/22 22:31:20 bdolson solved Problem0062 (Line: 2)
2025/10/22 22:30:35 bdolson solved Problem0061 (Line: 2)
2025/10/22 22:28:52 bdolson solved Problem0050 (Line: 2)
2025/10/22 22:27:33 bdolson solved Problem0050 (Line: 3)
2025/10/22 22:24:23 bdolson solved Problem0078 (Line: 1)
2025/10/22 22:23:53 bdolson solved Problem0049 (Line: 1)
2025/10/22 22:22:06 bdolson solved Problem0045 (Line: 1)
2025/10/22 22:21:55 bdolson solved Problem0035 (Line: 1)
2025/10/22 22:21:30 bdolson solved Problem0020 (Line: 12)
2025/10/22 22:19:57 bdolson solved Problem0020 (Line: 13)
2025/10/22 22:16:47 bdolson solved Problem0019 (Line: 5)
2025/10/22 22:14:54 bdolson solved Problem0018 (Line: 7)
2025/10/22 22:02:28 bdolson solved Problem0017 (Line: 2)
2025/10/22 22:01:31 bdolson solved Problem0016 (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.