Recent Submissions

2024/05/26 19:58:53 schzna solved Problem0033 (Line: 9)
2024/05/26 19:32:12 schzna solved Problem0054 (Line: 30)
2024/05/26 19:10:46 schzna solved Problem0055 (Line: 37)
2024/05/26 18:47:29 schzna solved Problem0048 (Line: 4)
2024/05/26 18:39:07 schzna solved Problem0085 (Line: 10)
2024/05/26 15:37:44 schzna solved Problem0084 (Line: 19)
2024/05/26 11:48:52 iammartin solved Problem0017 (Line: 2)
2024/05/26 11:47:22 iammartin solved Problem0016 (Line: 1)
2024/05/26 11:40:58 iammartin solved Problem0013 (Line: 9)
2024/05/26 02:51:56 schzna solved Problem0012 (Line: 12)
2024/05/26 02:04:21 schzna solved Problem0011 (Line: 11)
2024/05/26 01:56:31 schzna solved Problem0013 (Line: 8)
2024/05/26 00:33:00 schzna solved Problem0014 (Line: 15)
2024/05/25 13:29:43 Hinomishita solved Problem0024 (Line: 25)
2024/05/25 13:26:13 Hinomishita solved Problem0016 (Line: 1)
2024/05/25 13:22:09 Hinomishita solved Problem0019 (Line: 10)
2024/05/25 12:34:00 Hinomishita solved Problem0014 (Line: 9)
2024/05/25 12:00:25 yzkkai solved Problem0051 (Line: 3)
2024/05/25 11:59:35 yzkkai solved Problem0063 (Line: 3)
2024/05/25 11:57:55 yzkkai solved Problem0052 (Line: 3)
2024/05/25 01:23:32 yzkkai solved Problem0062 (Line: 2)
2024/05/25 01:22:18 yzkkai solved Problem0080 (Line: 2)
2024/05/25 01:10:48 yzkkai solved Problem0050 (Line: 2)
2024/05/25 01:09:12 yzkkai solved Problem0078 (Line: 1)
2024/05/25 01:08:47 yzkkai solved Problem0049 (Line: 1)
2024/05/25 01:07:51 yzkkai solved Problem0045 (Line: 1)
2024/05/25 01:07:34 yzkkai solved Problem0035 (Line: 1)
2024/05/25 01:06:40 yzkkai solved Problem0061 (Line: 2)
2024/05/25 00:26:32 yzkkai solved Problem0019 (Line: 5)
2024/05/25 00:21:35 thirvin solved Problem0010 (Line: 6)
2024/05/25 00:21:15 schzna solved Problem0082 (Line: 31)
2024/05/25 00:20:31 yzkkai solved Problem0017 (Line: 2)
2024/05/25 00:18:45 yzkkai solved Problem0016 (Line: 1)
2024/05/25 00:17:54 thirvin solved Problem0009 (Line: 4)
2024/05/25 00:16:07 thirvin solved Problem0008 (Line: 3)
2024/05/25 00:12:40 thirvin solved Problem0007 (Line: 3)
2024/05/25 00:12:00 thirvin solved Problem0006 (Line: 3)
2024/05/25 00:11:28 thirvin solved Problem0005 (Line: 1)
2024/05/25 00:10:39 thirvin solved Problem0004 (Line: 3)
2024/05/25 00:10:17 thirvin solved Problem0003 (Line: 1)
2024/05/25 00:07:40 thirvin solved Problem0002 (Line: 1)
2024/05/25 00:07:23 yzkkai solved Problem0009 (Line: 4)
2024/05/25 00:07:14 thirvin solved Problem0001 (Line: 1)
2024/05/25 00:06:10 yzkkai solved Problem0008 (Line: 3)
2024/05/25 00:03:39 yzkkai solved Problem0007 (Line: 3)
2024/05/25 00:01:21 yzkkai solved Problem0006 (Line: 3)
2024/05/25 00:00:43 yzkkai solved Problem0005 (Line: 1)
2024/05/24 23:59:45 yzkkai solved Problem0004 (Line: 3)
2024/05/24 23:57:21 yzkkai solved Problem0003 (Line: 1)
2024/05/24 23:55:09 yzkkai solved Problem0002 (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.