Recent Submissions

2025/04/24 23:43:17 Easy solved Problem0064 (Line: 6)
2025/04/24 23:40:52 Easy solved Problem0063 (Line: 3)
2025/04/24 23:39:34 Easy solved Problem0062 (Line: 2)
2025/04/24 23:37:38 Easy solved Problem0061 (Line: 2)
2025/04/24 23:36:49 tria solved Problem0069 (Line: 3)
2025/04/24 23:32:59 tria solved Problem0074 (Line: 4)
2025/04/24 23:27:30 tria solved Problem0079 (Line: 5)
2025/04/24 23:27:05 tria solved Problem0079 (Line: 6)
2025/04/24 23:24:48 tria solved Problem0080 (Line: 2)
2025/04/24 22:49:32 Easy solved Problem0053 (Line: 3)
2025/04/24 22:48:21 Easy solved Problem0052 (Line: 3)
2025/04/24 22:45:28 Easy solved Problem0051 (Line: 3)
2025/04/24 22:45:00 Easy solved Problem0050 (Line: 2)
2025/04/24 22:43:10 Easy solved Problem0049 (Line: 1)
2025/04/24 22:42:12 Easy solved Problem0048 (Line: 4)
2025/04/24 22:12:36 Easy solved Problem0045 (Line: 1)
2025/04/24 22:08:18 Easy solved Problem0044 (Line: 4)
2025/04/24 15:22:41 tria solved Problem0020 (Line: 12)
2025/04/24 13:58:07 tria solved Problem0036 (Line: 3)
2025/04/24 13:56:31 tria solved Problem0035 (Line: 1)
2025/04/24 13:55:24 tria solved Problem0085 (Line: 9)
2025/04/24 13:52:55 tria solved Problem0046 (Line: 7)
2025/04/24 13:48:32 tria solved Problem0045 (Line: 1)
2025/04/24 13:48:03 tria solved Problem0023 (Line: 5)
2025/04/24 13:40:55 tria solved Problem0023 (Line: 6)
2025/04/24 13:31:26 tria solved Problem0061 (Line: 2)
2025/04/24 13:27:58 tria solved Problem0048 (Line: 4)
2025/04/24 13:25:13 tria solved Problem0052 (Line: 3)
2025/04/24 13:23:19 tria solved Problem0051 (Line: 3)
2025/04/24 13:22:21 tria solved Problem0050 (Line: 2)
2025/04/24 13:15:50 tria solved Problem0049 (Line: 1)
2025/04/24 12:19:03 tria solved Problem0019 (Line: 10)
2025/04/24 08:47:28 Easy solved Problem0042 (Line: 2)
2025/04/24 08:33:48 Easy solved Problem0041 (Line: 6)
2025/04/24 08:29:44 Easy solved Problem0040 (Line: 5)
2025/04/24 08:21:52 Easy solved Problem0039 (Line: 4)
2025/04/24 07:58:24 Easy solved Problem0038 (Line: 5)
2025/04/24 07:54:13 Easy solved Problem0037 (Line: 6)
2025/04/24 07:48:36 Easy solved Problem0036 (Line: 3)
2025/04/24 07:46:23 Easy solved Problem0035 (Line: 1)
2025/04/24 07:16:50 Easy solved Problem0032 (Line: 8)
2025/04/24 07:09:17 Easy solved Problem0030 (Line: 7)
2025/04/24 06:32:48 Easy solved Problem0029 (Line: 6)
2025/04/24 04:21:56 Easy solved Problem0014 (Line: 8)
2025/04/24 04:10:06 Easy solved Problem0013 (Line: 7)
2025/04/24 01:56:29 tria solved Problem0014 (Line: 12)
2025/04/24 01:45:10 tria solved Problem0013 (Line: 11)
2025/04/24 01:28:50 tria solved Problem0053 (Line: 5)
2025/04/24 01:23:05 tria solved Problem0018 (Line: 7)
2025/04/24 01:20:46 tria solved Problem0017 (Line: 2)

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.