Recent Submissions

2023/02/01 20:21:03 sqrt_7 solved Problem0079 (Line: 5)
2023/02/01 20:12:04 sqrt_7 solved Problem0079 (Line: 5)
2023/02/01 20:10:57 sqrt_7 solved Problem0078 (Line: 1)
2023/02/01 19:42:13 sqrt_7 solved Problem0043 (Line: 6)
2023/02/01 19:40:22 sqrt_7 solved Problem0043 (Line: 6)
2023/02/01 18:54:28 kitagawahr solved Problem0062 (Line: 2)
2023/02/01 18:53:39 kitagawahr solved Problem0061 (Line: 2)
2023/02/01 18:51:12 kitagawahr solved Problem0050 (Line: 2)
2023/02/01 18:45:16 kitagawahr solved Problem0049 (Line: 1)
2023/02/01 18:44:44 kitagawahr solved Problem0035 (Line: 1)
2023/02/01 18:44:15 kitagawahr solved Problem0045 (Line: 1)
2023/02/01 18:44:02 kitagawahr solved Problem0078 (Line: 1)
2023/02/01 18:21:29 AC_Automation solved Problem0014 (Line: 10)
2023/02/01 18:06:24 sqrt_7 solved Problem0014 (Line: 10)
2023/02/01 17:20:01 maxChang solved Problem0011 (Line: 12)
2023/02/01 17:19:52 FallenStar_2007 solved Problem0027 (Line: 15)
2023/02/01 17:14:05 kitagawahr solved Problem0017 (Line: 2)
2023/02/01 17:12:43 kitagawahr solved Problem0016 (Line: 1)
2023/02/01 17:12:12 anthonyaaabc solved Problem0080 (Line: 2)
2023/02/01 17:10:27 FallenStar_2007 solved Problem0080 (Line: 2)
2023/02/01 17:09:19 FallenStar_2007 solved Problem0079 (Line: 5)
2023/02/01 17:08:14 anthonyaaabc solved Problem0053 (Line: 3)
2023/02/01 17:08:00 FallenStar_2007 solved Problem0078 (Line: 1)
2023/02/01 17:06:47 FallenStar_2007 solved Problem0062 (Line: 2)
2023/02/01 17:05:51 FallenStar_2007 solved Problem0061 (Line: 2)
2023/02/01 17:01:11 anthonyaaabc solved Problem0032 (Line: 8)
2023/02/01 16:58:02 FallenStar_2007 solved Problem0032 (Line: 8)
2023/02/01 16:52:30 lcqlily solved Problem0079 (Line: 5)
2023/02/01 16:39:22 FallenStar_2007 solved Problem0069 (Line: 3)
2023/02/01 16:39:20 kitagawahr solved Problem0010 (Line: 8)
2023/02/01 16:36:21 maxChang solved Problem0010 (Line: 7)
2023/02/01 16:26:51 lcqlily solved Problem0020 (Line: 12)
2023/02/01 16:25:41 lcqlily solved Problem0020 (Line: 13)
2023/02/01 16:17:56 FallenStar_2007 solved Problem0065 (Line: 9)
2023/02/01 16:12:10 FallenStar_2007 solved Problem0064 (Line: 9)
2023/02/01 16:09:17 FallenStar_2007 solved Problem0066 (Line: 10)
2023/02/01 16:06:28 FallenStar_2007 solved Problem0053 (Line: 3)
2023/02/01 16:04:50 lcqlily solved Problem0051 (Line: 3)
2023/02/01 16:04:05 FallenStar_2007 solved Problem0051 (Line: 3)
2023/02/01 16:03:19 lcqlily solved Problem0053 (Line: 3)
2023/02/01 16:01:58 FallenStar_2007 solved Problem0050 (Line: 2)
2023/02/01 16:01:29 FallenStar_2007 solved Problem0049 (Line: 1)
2023/02/01 16:01:04 maxChang solved Problem0009 (Line: 4)
2023/02/01 16:00:06 maxChang solved Problem0008 (Line: 3)
2023/02/01 15:49:46 maxChang solved Problem0007 (Line: 3)
2023/02/01 15:46:23 maxChang solved Problem0006 (Line: 3)
2023/02/01 15:45:50 maxChang solved Problem0005 (Line: 1)
2023/02/01 15:43:44 FallenStar_2007 solved Problem0046 (Line: 12)
2023/02/01 15:39:14 FallenStar_2007 solved Problem0045 (Line: 1)
2023/02/01 15:38:56 FallenStar_2007 solved Problem0044 (Line: 10)

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.