Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
Browse Problems
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: String Processing :: Ad Hoc String Processing Problems :: Input Parsing (Recursive)
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
384 - Slurpys | 6294 |
47.90%
|
2043 |
83.90%
|
|
|
|
464 - Sentence/Phrase Generator | 1858 |
32.02%
|
519 |
72.06%
|
|
|
|
620 - Cellular Structure | 4080 |
53.01%
|
1828 |
86.82%
|
|
|
|
622 - Grammar Evaluation | 3164 |
24.87%
|
1057 |
58.94%
|
|
|
|
743 - The MTM Machine | 2076 |
43.69%
|
865 |
72.83%
|
|
|
|
10854 - Number of Paths | 1458 |
49.04%
|
650 |
83.38%
|
|
|
|
11070 - The Good Old Times | 979 |
53.93%
|
448 |
86.83%
|
|
|
|
11291 - Smeech | 1334 |
46.33%
|
532 |
89.66%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |