Recent Submissions

2022/11/30 14:49:20 gksato solved Problem0015 (Line: 10)
2022/11/30 14:47:04 gksato solved Problem0015 (Line: 11)
2022/11/30 14:43:03 gksato solved Problem0015 (Line: 12)
2022/11/30 14:38:57 gksato solved Problem0015 (Line: 12)
2022/11/30 14:34:19 gksato solved Problem0015 (Line: 13)
2022/11/30 14:32:10 gksato solved Problem0015 (Line: 14)
2022/11/30 14:10:11 gksato solved Problem0015 (Line: 15)
2022/11/30 14:07:56 gksato solved Problem0015 (Line: 15)
2022/11/30 13:59:04 gksato solved Problem0015 (Line: 15)
2022/11/30 11:29:36 noem solved Problem0018 (Line: 7)
2022/11/30 11:22:49 HelloWorld solved Problem0020 (Line: 12)
2022/11/30 11:15:48 HelloWorld solved Problem0019 (Line: 5)
2022/11/30 11:05:37 HelloWorld solved Problem0018 (Line: 7)
2022/11/30 10:53:18 HelloWorld solved Problem0017 (Line: 2)
2022/11/30 10:51:11 HelloWorld solved Problem0016 (Line: 1)
2022/11/30 10:49:58 HelloWorld solved Problem0015 (Line: 9)
2022/11/30 10:04:54 HelloWorld solved Problem0014 (Line: 11)
2022/11/30 08:30:35 HelloWorld solved Problem0013 (Line: 9)
2022/11/30 07:43:45 HelloWorld solved Problem0012 (Line: 12)
2022/11/29 22:26:55 gksato solved Problem0032 (Line: 17)
2022/11/29 22:07:23 gksato solved Problem0032 (Line: 8)
2022/11/29 22:03:13 sato88888 solved Problem0078 (Line: 1)
2022/11/29 22:02:34 sato88888 solved Problem0049 (Line: 1)
2022/11/29 22:00:00 sato88888 solved Problem0045 (Line: 1)
2022/11/29 21:59:40 sato88888 solved Problem0035 (Line: 1)
2022/11/29 21:58:29 sato88888 solved Problem0018 (Line: 7)
2022/11/29 21:53:46 gksato solved Problem0032 (Line: 10)
2022/11/29 21:42:50 sato88888 solved Problem0017 (Line: 2)
2022/11/29 21:41:19 gksato solved Problem0029 (Line: 8)
2022/11/29 21:40:24 sato88888 solved Problem0016 (Line: 1)
2022/11/29 21:37:13 sato88888 solved Problem0011 (Line: 21)
2022/11/29 21:37:03 gksato solved Problem0028 (Line: 18)
2022/11/29 21:36:20 sato88888 solved Problem0011 (Line: 22)
2022/11/29 21:21:58 gksato solved Problem0028 (Line: 19)
2022/11/29 21:09:52 sato88888 solved Problem0010 (Line: 7)
2022/11/29 20:52:40 sato88888 solved Problem0009 (Line: 4)
2022/11/29 20:51:25 sato88888 solved Problem0009 (Line: 5)
2022/11/29 20:33:06 sato88888 solved Problem0008 (Line: 3)
2022/11/29 20:30:14 sato88888 solved Problem0007 (Line: 3)
2022/11/29 20:28:39 sato88888 solved Problem0006 (Line: 3)
2022/11/29 20:27:31 sato88888 solved Problem0005 (Line: 1)
2022/11/29 20:25:24 sato88888 solved Problem0004 (Line: 3)
2022/11/29 20:24:37 sato88888 solved Problem0003 (Line: 1)
2022/11/29 20:23:25 sato88888 solved Problem0002 (Line: 1)
2022/11/29 20:22:15 sato88888 solved Problem0002 (Line: 2)
2022/11/29 20:21:45 sato88888 solved Problem0001 (Line: 1)
2022/11/29 15:26:13 Eutaxy solved Problem0046 (Line: 7)
2022/11/29 13:38:21 noem solved Problem0017 (Line: 2)
2022/11/29 13:36:43 noem solved Problem0016 (Line: 1)
2022/11/29 04:53:19 AlexS solved Problem0007 (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.