Recent Submissions

2025/07/15 21:45:20 buggger solved Problem0006 (Line: 3)
2025/07/15 21:42:06 buggger solved Problem0005 (Line: 1)
2025/07/15 21:33:12 buggger solved Problem0004 (Line: 3)
2025/07/15 21:27:52 buggger solved Problem0003 (Line: 1)
2025/07/15 21:27:22 buggger solved Problem0002 (Line: 1)
2025/07/15 21:26:56 buggger solved Problem0001 (Line: 1)
2025/07/15 19:00:32 pe200012 solved Problem0002 (Line: 1)
2025/07/15 19:00:09 pe200012 solved Problem0001 (Line: 1)
2025/07/15 18:53:13 kedec solved Problem0017 (Line: 2)
2025/07/15 18:52:46 kedec solved Problem0016 (Line: 1)
2025/07/15 18:50:33 kedec solved Problem0014 (Line: 9)
2025/07/15 18:43:25 kedec solved Problem0013 (Line: 8)
2025/07/15 18:42:32 kedec solved Problem0013 (Line: 10)
2025/07/15 18:32:32 kedec solved Problem0011 (Line: 11)
2025/07/15 18:28:59 kedec solved Problem0010 (Line: 7)
2025/07/15 18:26:40 kedec solved Problem0009 (Line: 4)
2025/07/15 18:25:53 kedec solved Problem0008 (Line: 3)
2025/07/15 18:19:43 kedec solved Problem0007 (Line: 3)
2025/07/15 18:19:16 kedec solved Problem0006 (Line: 3)
2025/07/15 18:18:46 kedec solved Problem0005 (Line: 1)
2025/07/15 18:18:19 kedec solved Problem0004 (Line: 3)
2025/07/15 18:17:59 kedec solved Problem0003 (Line: 1)
2025/07/15 18:17:27 kedec solved Problem0002 (Line: 1)
2025/07/15 18:17:14 kedec solved Problem0001 (Line: 1)
2025/07/15 18:09:15 ifxnug solved Problem0009 (Line: 4)
2025/07/15 18:03:22 georeth solved Problem0028 (Line: 27)
2025/07/15 18:02:12 ifxnug solved Problem0008 (Line: 3)
2025/07/15 17:56:29 georeth solved Problem0027 (Line: 10)
2025/07/15 17:54:59 georeth solved Problem0027 (Line: 15)
2025/07/15 17:53:15 georeth solved Problem0026 (Line: 13)
2025/07/15 17:42:40 georeth solved Problem0025 (Line: 6)
2025/07/15 17:41:47 Breaker solved Problem0007 (Line: 3)
2025/07/15 17:40:39 Breaker solved Problem0006 (Line: 3)
2025/07/15 17:40:04 Breaker solved Problem0005 (Line: 1)
2025/07/15 17:39:27 Breaker solved Problem0004 (Line: 3)
2025/07/15 17:38:49 Breaker solved Problem0003 (Line: 1)
2025/07/15 17:38:36 Breaker solved Problem0002 (Line: 1)
2025/07/15 17:38:08 Breaker solved Problem0001 (Line: 1)
2025/07/15 17:19:24 ifxnug solved Problem0007 (Line: 3)
2025/07/15 17:17:10 georeth solved Problem0024 (Line: 25)
2025/07/15 17:17:07 ifxnug solved Problem0006 (Line: 3)
2025/07/15 17:15:01 ifxnug solved Problem0005 (Line: 1)
2025/07/15 17:14:24 snuke2235 solved Problem0008 (Line: 3)
2025/07/15 17:10:55 ifxnug solved Problem0004 (Line: 3)
2025/07/15 17:10:14 georeth solved Problem0023 (Line: 5)
2025/07/15 17:08:15 georeth solved Problem0023 (Line: 6)
2025/07/15 17:04:01 ifxnug solved Problem0003 (Line: 1)
2025/07/15 17:02:51 ifxnug solved Problem0002 (Line: 1)
2025/07/15 17:01:24 georeth solved Problem0023 (Line: 9)
2025/07/15 16:59:49 ifxnug solved Problem0001 (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.