Recent Submissions

2022/06/26 11:23:18 peparoni solved Problem0001 (Line: 1)
2022/06/25 23:03:14 TeaBream solved Problem0020 (Line: 12)
2022/06/25 00:49:11 sedna solved Problem0020 (Line: 12)
2022/06/24 16:16:15 takoyakitarou solved Problem0063 (Line: 3)
2022/06/24 10:55:20 504Hz solved Problem0032 (Line: 10)
2022/06/24 10:52:45 504Hz solved Problem0031 (Line: 17)
2022/06/24 10:52:35 504Hz solved Problem0030 (Line: 17)
2022/06/24 10:52:20 504Hz solved Problem0029 (Line: 17)
2022/06/24 07:34:07 takoyakitarou solved Problem0017 (Line: 2)
2022/06/24 07:28:58 takoyakitarou solved Problem0080 (Line: 2)
2022/06/24 07:26:55 takoyakitarou solved Problem0082 (Line: 12)
2022/06/24 07:25:17 takoyakitarou solved Problem0079 (Line: 7)
2022/06/24 07:16:53 takoyakitarou solved Problem0062 (Line: 2)
2022/06/24 07:15:56 takoyakitarou solved Problem0041 (Line: 14)
2022/06/24 07:08:31 takoyakitarou solved Problem0045 (Line: 1)
2022/06/24 07:07:00 takoyakitarou solved Problem0037 (Line: 8)
2022/06/24 07:06:01 takoyakitarou solved Problem0034 (Line: 8)
2022/06/24 02:51:59 unigiri solved Problem0005 (Line: 1)
2022/06/24 02:47:46 unigiri solved Problem0004 (Line: 3)
2022/06/24 02:44:37 unigiri solved Problem0003 (Line: 1)
2022/06/24 02:42:26 unigiri solved Problem0002 (Line: 1)
2022/06/24 02:40:39 unigiri solved Problem0001 (Line: 1)
2022/06/24 00:22:59 sedna solved Problem0023 (Line: 5)
2022/06/23 21:56:18 takoyakitarou solved Problem0078 (Line: 1)
2022/06/23 21:55:38 takoyakitarou solved Problem0069 (Line: 3)
2022/06/23 21:40:18 takoyakitarou solved Problem0029 (Line: 11)
2022/06/23 21:35:57 takoyakitarou solved Problem0025 (Line: 5)
2022/06/23 21:33:44 takoyakitarou solved Problem0019 (Line: 5)
2022/06/23 21:32:41 takoyakitarou solved Problem0036 (Line: 3)
2022/06/23 21:32:00 takoyakitarou solved Problem0027 (Line: 10)
2022/06/23 21:28:05 takoyakitarou solved Problem0035 (Line: 1)
2022/06/23 21:27:13 takoyakitarou solved Problem0061 (Line: 2)
2022/06/23 21:25:29 takoyakitarou solved Problem0051 (Line: 3)
2022/06/23 21:23:39 takoyakitarou solved Problem0050 (Line: 2)
2022/06/23 21:23:06 takoyakitarou solved Problem0049 (Line: 1)
2022/06/23 21:22:44 takoyakitarou solved Problem0024 (Line: 25)
2022/06/23 21:20:06 takoyakitarou solved Problem0020 (Line: 12)
2022/06/23 21:18:13 takoyakitarou solved Problem0018 (Line: 7)
2022/06/23 18:52:57 takoyakitarou solved Problem0052 (Line: 3)
2022/06/23 07:29:54 takoyakitarou solved Problem0052 (Line: 5)
2022/06/23 07:21:19 takoyakitarou solved Problem0028 (Line: 22)
2022/06/23 07:20:53 takoyakitarou solved Problem0028 (Line: 23)
2022/06/23 07:09:45 takoyakitarou solved Problem0053 (Line: 3)
2022/06/23 07:06:06 takoyakitarou solved Problem0081 (Line: 8)
2022/06/23 07:05:04 takoyakitarou solved Problem0081 (Line: 10)
2022/06/23 07:01:35 takoyakitarou solved Problem0085 (Line: 9)
2022/06/23 01:03:57 k_sui solved Problem0011 (Line: 11)
2022/06/23 00:46:54 spa15332 solved Problem0011 (Line: 31)
2022/06/22 23:34:13 spa15332 solved Problem0010 (Line: 7)
2022/06/22 23:27:36 spa15332 solved Problem0009 (Line: 4)

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.