Recent Submissions

2021/05/14 00:14:24 kurowassann solved Problem0085 (Line: 11)
2021/05/14 00:14:01 semiexp solved Problem0081 (Line: 6)
2021/05/14 00:13:55 l_ength solved Problem0078 (Line: 1)
2021/05/14 00:13:50 zezero solved Problem0006 (Line: 3)
2021/05/14 00:13:31 FF256grhy solved Problem0085 (Line: 9)
2021/05/14 00:13:05 bakaming solved Problem0080 (Line: 2)
2021/05/14 00:13:03 y61mpnl solved Problem0081 (Line: 8)
2021/05/14 00:12:48 minefy solved Problem0079 (Line: 5)
2021/05/14 00:12:45 sugim48 solved Problem0083 (Line: 11)
2021/05/14 00:12:30 apiad solved Problem0081 (Line: 7)
2021/05/14 00:12:27 tetra solved Problem0081 (Line: 9)
2021/05/14 00:12:17 Yu_212 solved Problem0084 (Line: 23)
2021/05/14 00:12:12 zezero solved Problem0005 (Line: 1)
2021/05/14 00:12:00 hir35 solved Problem0085 (Line: 9)
2021/05/14 00:11:54 gusmachine solved Problem0084 (Line: 28)
2021/05/14 00:11:53 Johann solved Problem0079 (Line: 5)
2021/05/14 00:11:45 minefy solved Problem0078 (Line: 1)
2021/05/14 00:11:27 sugim48 solved Problem0084 (Line: 11)
2021/05/14 00:11:22 sapphire15 solved Problem0078 (Line: 1)
2021/05/14 00:11:22 apiad solved Problem0081 (Line: 8)
2021/05/14 00:11:17 Johann solved Problem0079 (Line: 5)
2021/05/14 00:11:04 arock solved Problem0083 (Line: 21)
2021/05/14 00:10:54 apiad solved Problem0081 (Line: 9)
2021/05/14 00:09:53 hir35 solved Problem0082 (Line: 16)
2021/05/14 00:09:14 kurowassann solved Problem0080 (Line: 2)
2021/05/14 00:09:13 apiad solved Problem0080 (Line: 2)
2021/05/14 00:09:01 null0124 solved Problem0078 (Line: 1)
2021/05/14 00:08:38 mtsd solved Problem0085 (Line: 9)
2021/05/14 00:08:37 natsugiri solved Problem0079 (Line: 4)
2021/05/14 00:08:21 Eki1009 solved Problem0082 (Line: 12)
2021/05/14 00:08:20 phyllo solved Problem0085 (Line: 10)
2021/05/14 00:07:55 bakaming solved Problem0079 (Line: 5)
2021/05/14 00:07:28 snuke solved Problem0085 (Line: 8)
2021/05/14 00:07:13 Ktya solved Problem0084 (Line: 19)
2021/05/14 00:06:54 Ktya solved Problem0083 (Line: 19)
2021/05/14 00:06:42 kurowassann solved Problem0079 (Line: 4)
2021/05/14 00:06:32 catupper solved Problem0079 (Line: 4)
2021/05/14 00:06:32 FF256grhy solved Problem0082 (Line: 12)
2021/05/14 00:06:24 y61mpnl solved Problem0085 (Line: 9)
2021/05/14 00:05:33 bakaming solved Problem0078 (Line: 1)
2021/05/14 00:05:24 kurowassann solved Problem0078 (Line: 1)
2021/05/14 00:05:10 apiad solved Problem0083 (Line: 15)
2021/05/14 00:04:48 4s solved Problem0085 (Line: 6)
2021/05/14 00:04:29 g399 solved Problem0063 (Line: 4)
2021/05/14 00:03:30 I_love_Hoang_Yen solved Problem0079 (Line: 4)
2021/05/14 00:03:07 Eki1009 solved Problem0081 (Line: 7)
2021/05/14 00:03:06 snuke solved Problem0080 (Line: 2)
2021/05/14 00:02:55 snuke solved Problem0079 (Line: 4)
2021/05/14 00:02:49 Roundgod solved Problem0008 (Line: 3)
2021/05/14 00:01:49 apiad solved Problem0078 (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.