Recent Submissions

2021/12/09 18:00:53 motomiya solved Problem0039 (Line: 4)
2021/12/09 17:44:47 motomiya solved Problem0038 (Line: 5)
2021/12/09 12:09:47 828sui solved Problem0049 (Line: 1)
2021/12/09 12:09:29 828sui solved Problem0037 (Line: 6)
2021/12/09 12:07:36 828sui solved Problem0036 (Line: 3)
2021/12/09 12:06:43 828sui solved Problem0035 (Line: 1)
2021/12/09 12:05:40 828sui solved Problem0028 (Line: 18)
2021/12/09 11:48:54 828sui solved Problem0020 (Line: 13)
2021/12/09 11:31:20 828sui solved Problem0019 (Line: 10)
2021/12/08 11:50:49 Suiseiseki solved Problem0067 (Line: 7)
2021/12/05 20:28:08 Seniorious solved Problem0042 (Line: 2)
2021/12/05 11:19:30 Setras solved Problem0012 (Line: 35)
2021/12/05 10:52:51 craus solved Problem0014 (Line: 10)
2021/12/05 10:49:59 Setras solved Problem0011 (Line: 43)
2021/12/05 10:48:20 craus solved Problem0014 (Line: 10)
2021/12/05 10:35:49 craus solved Problem0013 (Line: 9)
2021/12/05 10:29:44 craus solved Problem0013 (Line: 10)
2021/12/05 10:18:53 Setras solved Problem0010 (Line: 7)
2021/12/05 10:16:18 craus solved Problem0013 (Line: 13)
2021/12/05 10:07:48 craus solved Problem0012 (Line: 11)
2021/12/05 10:02:58 Setras solved Problem0009 (Line: 4)
2021/12/05 09:59:10 Setras solved Problem0008 (Line: 3)
2021/12/05 09:56:01 craus solved Problem0011 (Line: 11)
2021/12/05 09:53:42 Setras solved Problem0007 (Line: 3)
2021/12/05 09:52:01 Setras solved Problem0006 (Line: 3)
2021/12/05 09:50:57 Setras solved Problem0005 (Line: 1)
2021/12/05 09:50:28 Setras solved Problem0004 (Line: 3)
2021/12/05 09:49:13 Setras solved Problem0003 (Line: 1)
2021/12/05 09:47:34 Setras solved Problem0002 (Line: 1)
2021/12/05 09:46:54 Setras solved Problem0001 (Line: 1)
2021/12/05 09:45:42 Setras solved Problem0001 (Line: 1)
2021/12/05 09:38:32 craus solved Problem0010 (Line: 7)
2021/12/05 09:24:43 craus solved Problem0010 (Line: 7)
2021/12/05 09:22:36 craus solved Problem0009 (Line: 4)
2021/12/05 09:21:35 craus solved Problem0008 (Line: 3)
2021/12/05 09:15:08 craus solved Problem0007 (Line: 3)
2021/12/05 09:14:33 craus solved Problem0006 (Line: 3)
2021/12/05 09:14:09 craus solved Problem0005 (Line: 1)
2021/12/05 09:12:49 craus solved Problem0004 (Line: 3)
2021/12/05 09:10:56 craus solved Problem0003 (Line: 1)
2021/12/05 09:10:16 craus solved Problem0002 (Line: 1)
2021/12/05 09:04:00 craus solved Problem0001 (Line: 1)
2021/12/04 18:32:07 Cirno_9baka solved Problem0013 (Line: 11)
2021/12/04 18:26:16 leukocyte solved Problem0067 (Line: 7)
2021/12/02 23:58:47 leukocyte solved Problem0067 (Line: 8)
2021/12/02 23:45:01 KG1109 solved Problem0063 (Line: 3)
2021/12/02 23:29:39 leukocyte solved Problem0065 (Line: 7)
2021/12/02 23:14:51 leukocyte solved Problem0065 (Line: 8)
2021/12/02 23:10:37 leukocyte solved Problem0064 (Line: 6)
2021/12/02 19:46:52 joylintp solved Problem0008 (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.