Recent Submissions

2024/02/25 01:09:04 aixaxia solved Problem0010 (Line: 7)
2024/02/25 01:06:09 aixaxia solved Problem0009 (Line: 4)
2024/02/25 01:05:32 aixaxia solved Problem0008 (Line: 3)
2024/02/25 01:03:15 aixaxia solved Problem0007 (Line: 3)
2024/02/25 01:02:04 aixaxia solved Problem0006 (Line: 3)
2024/02/25 01:01:34 aixaxia solved Problem0005 (Line: 1)
2024/02/25 00:59:31 aixaxia solved Problem0004 (Line: 3)
2024/02/25 00:59:11 aixaxia solved Problem0003 (Line: 1)
2024/02/25 00:58:34 aixaxia solved Problem0002 (Line: 1)
2024/02/25 00:58:16 aixaxia solved Problem0001 (Line: 1)
2024/02/24 16:11:51 bilibilitdasc solved Problem0032 (Line: 10)
2024/02/24 16:10:10 bilibilitdasc solved Problem0032 (Line: 10)
2024/02/24 16:09:16 bilibilitdasc solved Problem0032 (Line: 13)
2024/02/24 16:06:09 bilibilitdasc solved Problem0013 (Line: 14)
2024/02/24 15:56:29 bilibilitdasc solved Problem0010 (Line: 7)
2024/02/24 15:44:20 bilibilitdasc solved Problem0024 (Line: 11)
2024/02/24 15:39:40 bilibilitdasc solved Problem0024 (Line: 11)
2024/02/24 15:39:28 bilibilitdasc solved Problem0024 (Line: 11)
2024/02/24 15:33:41 bilibilitdasc solved Problem0024 (Line: 11)
2024/02/24 15:27:48 bilibilitdasc solved Problem0041 (Line: 6)
2024/02/24 15:25:38 bilibilitdasc solved Problem0047 (Line: 15)
2024/02/24 15:23:43 bilibilitdasc solved Problem0047 (Line: 15)
2024/02/24 15:22:19 bilibilitdasc solved Problem0047 (Line: 18)
2024/02/24 15:15:44 bilibilitdasc solved Problem0047 (Line: 20)
2024/02/24 15:10:35 bilibilitdasc solved Problem0046 (Line: 7)
2024/02/24 15:08:46 bilibilitdasc solved Problem0052 (Line: 3)
2024/02/24 15:08:26 bilibilitdasc solved Problem0052 (Line: 3)
2024/02/24 15:06:54 bilibilitdasc solved Problem0052 (Line: 4)
2024/02/24 15:06:20 bilibilitdasc solved Problem0052 (Line: 4)
2024/02/24 15:06:01 bilibilitdasc solved Problem0052 (Line: 4)
2024/02/24 14:16:43 bilibilitdasc solved Problem0077 (Line: 37)
2024/02/24 14:07:21 bilibilitdasc solved Problem0067 (Line: 12)
2024/02/24 12:32:11 bilibilitdasc solved Problem0038 (Line: 5)
2024/02/24 12:11:58 bilibilitdasc solved Problem0013 (Line: 11)
2024/02/24 12:08:17 bilibilitdasc solved Problem0012 (Line: 11)
2024/02/24 12:01:41 bilibilitdasc solved Problem0010 (Line: 7)
2024/02/24 11:59:56 bilibilitdasc solved Problem0010 (Line: 8)
2024/02/24 11:59:29 bilibilitdasc solved Problem0010 (Line: 11)
2024/02/24 11:56:32 bilibilitdasc solved Problem0011 (Line: 11)
2024/02/24 00:20:34 bilibilitdasc solved Problem0079 (Line: 5)
2024/02/23 16:03:04 Little_Cart solved Problem0024 (Line: 17)
2024/02/23 15:59:11 Little_Cart solved Problem0024 (Line: 25)
2024/02/23 15:53:22 Little_Cart solved Problem0018 (Line: 8)
2024/02/23 15:52:00 Little_Cart solved Problem0018 (Line: 8)
2024/02/23 15:50:13 Little_Cart solved Problem0019 (Line: 10)
2024/02/23 15:48:23 Little_Cart solved Problem0017 (Line: 2)
2024/02/23 15:43:59 Little_Cart solved Problem0016 (Line: 1)
2024/02/23 15:41:22 Mark6 solved Problem0041 (Line: 13)
2024/02/23 15:41:20 Little_Cart solved Problem0013 (Line: 7)
2024/02/23 15:36:50 Little_Cart solved Problem0012 (Line: 11)

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.