Recent Submissions

2020/10/22 11:15:44 akane solved Problem0059 (Line: 7)
2020/10/22 10:57:30 akane solved Problem0059 (Line: 11)
2020/10/22 10:44:58 akane solved Problem0059 (Line: 12)
2020/10/21 11:16:55 akane solved Problem0072 (Line: 9)
2020/10/21 10:42:03 akane solved Problem0072 (Line: 7)
2020/10/21 01:00:14 Carepoin solved Problem0011 (Line: 21)
2020/10/20 14:27:35 remonmaru solved Problem0001 (Line: 1)
2020/10/17 16:37:22 Yupiteru solved Problem0076 (Line: 10)
2020/10/17 01:35:20 Carepoin solved Problem0053 (Line: 3)
2020/10/17 01:29:35 Carepoin solved Problem0010 (Line: 8)
2020/10/17 00:54:48 Carepoin solved Problem0009 (Line: 5)
2020/10/17 00:52:53 Carepoin solved Problem0008 (Line: 3)
2020/10/17 00:50:10 Carepoin solved Problem0007 (Line: 3)
2020/10/17 00:46:16 Carepoin solved Problem0006 (Line: 3)
2020/10/17 00:45:22 Carepoin solved Problem0005 (Line: 1)
2020/10/17 00:44:30 Carepoin solved Problem0004 (Line: 3)
2020/10/17 00:43:43 Carepoin solved Problem0003 (Line: 1)
2020/10/17 00:41:12 Carepoin solved Problem0002 (Line: 1)
2020/10/17 00:40:48 Carepoin solved Problem0001 (Line: 1)
2020/10/16 13:24:33 fly solved Problem0023 (Line: 6)
2020/10/15 11:15:04 akane solved Problem0073 (Line: 8)
2020/10/14 10:38:07 akane solved Problem0027 (Line: 9)
2020/10/12 11:14:41 akane solved Problem0047 (Line: 16)
2020/10/12 00:39:17 BTLNM solved Problem0022 (Line: 12)
2020/10/08 12:45:07 akane solved Problem0068 (Line: 3)
2020/10/08 12:40:02 akane solved Problem0068 (Line: 3)
2020/10/08 12:30:59 akane solved Problem0068 (Line: 5)
2020/10/08 01:45:54 Yupiteru solved Problem0076 (Line: 11)
2020/10/08 00:14:50 Yupiteru solved Problem0076 (Line: 11)
2020/10/07 11:01:21 akane solved Problem0055 (Line: 46)
2020/10/07 10:57:31 akane solved Problem0055 (Line: 54)
2020/10/05 11:14:40 akane solved Problem0074 (Line: 5)
2020/10/05 11:02:10 akane solved Problem0074 (Line: 5)
2020/10/05 10:51:31 akane solved Problem0074 (Line: 6)
2020/10/05 10:48:44 akane solved Problem0074 (Line: 6)
2020/10/05 02:00:32 rivi09 solved Problem0064 (Line: 6)
2020/10/04 16:19:46 shiomusubi496 solved Problem0064 (Line: 9)
2020/10/04 16:16:23 shiomusubi496 solved Problem0062 (Line: 2)
2020/10/04 16:14:12 shiomusubi496 solved Problem0061 (Line: 2)
2020/10/04 16:10:14 shiomusubi496 solved Problem0053 (Line: 3)
2020/10/04 16:09:15 shiomusubi496 solved Problem0051 (Line: 4)
2020/10/04 16:08:27 shiomusubi496 solved Problem0050 (Line: 2)
2020/10/04 16:07:49 shiomusubi496 solved Problem0049 (Line: 1)
2020/10/04 16:07:16 shiomusubi496 solved Problem0045 (Line: 1)
2020/10/04 15:59:16 shiomusubi496 solved Problem0041 (Line: 13)
2020/10/04 15:54:42 shiomusubi496 solved Problem0040 (Line: 15)
2020/10/04 15:52:45 shiomusubi496 solved Problem0039 (Line: 15)
2020/10/04 15:48:16 shiomusubi496 solved Problem0038 (Line: 9)
2020/10/04 15:42:40 shiomusubi496 solved Problem0037 (Line: 8)
2020/10/04 15:41:58 shiomusubi496 solved Problem0036 (Line: 3)

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.