Recent Submissions

2023/11/29 01:12:05 yaichi solved Problem0048 (Line: 4)
2023/11/29 01:06:53 yaichi solved Problem0041 (Line: 6)
2023/11/28 23:44:34 yaichi solved Problem0047 (Line: 31)
2023/11/28 21:53:05 eyemono_moe solved Problem0007 (Line: 3)
2023/11/28 21:51:40 eyemono_moe solved Problem0006 (Line: 3)
2023/11/28 21:50:57 eyemono_moe solved Problem0005 (Line: 1)
2023/11/28 21:50:38 eyemono_moe solved Problem0004 (Line: 3)
2023/11/28 21:49:55 eyemono_moe solved Problem0003 (Line: 1)
2023/11/28 21:49:30 eyemono_moe solved Problem0002 (Line: 1)
2023/11/28 21:49:09 eyemono_moe solved Problem0001 (Line: 1)
2023/11/28 21:31:44 noya2 solved Problem0085 (Line: 6)
2023/11/28 21:10:49 yukikurage solved Problem0085 (Line: 6)
2023/11/28 20:55:25 H1rono solved Problem0023 (Line: 7)
2023/11/28 20:49:03 SSlime solved Problem0085 (Line: 10)
2023/11/28 19:56:56 yaichi solved Problem0039 (Line: 4)
2023/11/28 19:47:30 yaichi solved Problem0039 (Line: 4)
2023/11/28 19:24:45 yaichi solved Problem0038 (Line: 5)
2023/11/28 17:57:15 yaichi solved Problem0064 (Line: 8)
2023/11/28 17:47:37 yaichi solved Problem0037 (Line: 6)
2023/11/28 12:41:16 bpdolson solved Problem0035 (Line: 1)
2023/11/28 12:37:11 bpdolson solved Problem0052 (Line: 4)
2023/11/28 12:35:39 bpdolson solved Problem0051 (Line: 3)
2023/11/28 12:35:00 bpdolson solved Problem0051 (Line: 4)
2023/11/28 12:31:55 bpdolson solved Problem0050 (Line: 2)
2023/11/28 12:31:02 bpdolson solved Problem0049 (Line: 1)
2023/11/28 12:30:48 bpdolson solved Problem0049 (Line: 3)
2023/11/28 10:54:47 azzn solved Problem0048 (Line: 4)
2023/11/28 10:26:14 bpdolson solved Problem0027 (Line: 31)
2023/11/28 10:21:33 bpdolson solved Problem0026 (Line: 57)
2023/11/28 08:55:38 yaichi solved Problem0069 (Line: 2)
2023/11/28 08:00:00 yaichi solved Problem0050 (Line: 2)
2023/11/28 06:21:01 yaichi solved Problem0046 (Line: 7)
2023/11/28 06:08:52 yaichi solved Problem0044 (Line: 5)
2023/11/28 06:06:09 yaichi solved Problem0026 (Line: 9)
2023/11/28 05:48:51 yaichi solved Problem0024 (Line: 11)
2023/11/28 05:28:54 yaichi solved Problem0022 (Line: 12)
2023/11/28 05:15:52 yaichi solved Problem0012 (Line: 11)
2023/11/28 04:25:32 yaichi solved Problem0025 (Line: 5)
2023/11/28 03:47:43 yaichi solved Problem0025 (Line: 7)
2023/11/28 02:37:49 yaichi solved Problem0067 (Line: 12)
2023/11/28 01:35:14 yaichi solved Problem0047 (Line: 33)
2023/11/28 01:02:11 yaichi solved Problem0073 (Line: 14)
2023/11/28 00:51:58 yaichi solved Problem0074 (Line: 6)
2023/11/27 22:57:33 yaichi solved Problem0038 (Line: 6)
2023/11/27 22:34:05 yaichi solved Problem0074 (Line: 8)
2023/11/27 22:28:52 yaichi solved Problem0033 (Line: 6)
2023/11/27 20:41:12 azzn solved Problem0081 (Line: 6)
2023/11/27 20:29:40 azzn solved Problem0074 (Line: 4)
2023/11/27 19:12:22 yaichi solved Problem0075 (Line: 24)
2023/11/27 19:11:55 yaichi solved Problem0075 (Line: 24)

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.