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 | 6305 |
47.93%
|
2049 |
83.85%
|
|
|
|
464 - Sentence/Phrase Generator | 1859 |
32.01%
|
520 |
71.92%
|
|
|
|
620 - Cellular Structure | 4093 |
53.02%
|
1833 |
86.80%
|
|
|
|
622 - Grammar Evaluation | 3171 |
25.01%
|
1062 |
59.04%
|
|
|
|
743 - The MTM Machine | 2083 |
43.69%
|
867 |
72.78%
|
|
|
|
10854 - Number of Paths | 1501 |
48.43%
|
656 |
83.38%
|
|
|
|
11070 - The Good Old Times | 986 |
54.16%
|
452 |
86.73%
|
|
|
|
11291 - Smeech | 1366 |
46.27%
|
538 |
89.41%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |