Recent Submissions

2020/12/01 20:32:15 Izayoi_R solved Problem0019 (Line: 5)
2020/12/01 20:28:45 Izayoi_R solved Problem0001 (Line: 1)
2020/11/23 05:01:53 Ayeye solved Problem0011 (Line: 11)
2020/11/23 04:45:54 Ayeye solved Problem0010 (Line: 7)
2020/11/22 21:46:35 TKO919 solved Problem0069 (Line: 3)
2020/11/10 23:56:22 Cyclone28 solved Problem0016 (Line: 1)
2020/11/10 23:51:32 Cyclone28 solved Problem0003 (Line: 1)
2020/11/10 23:50:00 Cyclone28 solved Problem0002 (Line: 1)
2020/11/10 23:48:06 Cyclone28 solved Problem0001 (Line: 1)
2020/11/08 02:27:42 Wave solved Problem0010 (Line: 6)
2020/11/08 02:14:15 Wave solved Problem0010 (Line: 7)
2020/11/07 20:50:52 Ruthenium_71 solved Problem0010 (Line: 6)
2020/11/06 09:48:24 siotouto solved Problem0048 (Line: 4)
2020/11/06 09:46:01 siotouto solved Problem0048 (Line: 5)
2020/11/06 09:44:58 siotouto solved Problem0048 (Line: 5)
2020/11/06 09:42:02 siotouto solved Problem0048 (Line: 6)
2020/11/06 09:41:49 siotouto solved Problem0048 (Line: 7)
2020/11/06 09:17:04 siotouto solved Problem0047 (Line: 17)
2020/11/06 09:05:29 siotouto solved Problem0027 (Line: 9)
2020/11/06 09:01:24 siotouto solved Problem0027 (Line: 9)
2020/11/05 20:12:19 edikxl solved Problem0001 (Line: 1)
2020/11/05 02:49:07 keymoon solved Problem0069 (Line: 2)
2020/11/05 02:31:37 keymoon solved Problem0015 (Line: 14)
2020/11/05 02:31:21 keymoon solved Problem0015 (Line: 14)
2020/11/05 02:18:34 keymoon solved Problem0013 (Line: 8)
2020/11/05 02:12:52 keymoon solved Problem0010 (Line: 6)
2020/11/04 21:16:38 RotAWA solved Problem0011 (Line: 34)
2020/11/03 14:30:09 i_have_no_name solved Problem0023 (Line: 5)
2020/11/03 14:23:34 i_have_no_name solved Problem0023 (Line: 6)
2020/11/03 14:22:16 i_have_no_name solved Problem0023 (Line: 6)
2020/11/03 14:20:54 i_have_no_name solved Problem0023 (Line: 9)
2020/11/01 17:57:02 matsu7874 solved Problem0007 (Line: 4)
2020/11/01 17:55:10 matsu7874 solved Problem0006 (Line: 3)
2020/11/01 17:54:37 matsu7874 solved Problem0005 (Line: 1)
2020/11/01 17:54:16 matsu7874 solved Problem0004 (Line: 3)
2020/11/01 17:53:59 matsu7874 solved Problem0003 (Line: 1)
2020/11/01 17:51:42 matsu7874 solved Problem0002 (Line: 1)
2020/11/01 17:50:41 matsu7874 solved Problem0001 (Line: 1)
2020/11/01 01:59:09 RotAWA solved Problem0010 (Line: 8)
2020/11/01 01:49:28 RotAWA solved Problem0009 (Line: 4)
2020/10/31 16:10:45 RotAWA solved Problem0009 (Line: 4)
2020/10/31 16:07:40 RotAWA solved Problem0008 (Line: 3)
2020/10/31 16:02:00 RotAWA solved Problem0007 (Line: 3)
2020/10/31 16:01:10 RotAWA solved Problem0006 (Line: 3)
2020/10/31 16:00:21 RotAWA solved Problem0005 (Line: 1)
2020/10/31 15:59:48 RotAWA solved Problem0004 (Line: 3)
2020/10/31 15:59:16 RotAWA solved Problem0003 (Line: 1)
2020/10/31 15:59:04 RotAWA solved Problem0002 (Line: 1)
2020/10/31 15:58:31 RotAWA solved Problem0001 (Line: 1)
2020/10/31 15:58:18 RotAWA solved Problem0001 (Line: 1)

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.