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 | 6299 |
47.94%
|
2046 |
83.92%
|
|
|
|
464 - Sentence/Phrase Generator | 1858 |
32.02%
|
519 |
72.06%
|
|
|
|
620 - Cellular Structure | 4084 |
53.06%
|
1830 |
86.83%
|
|
|
|
622 - Grammar Evaluation | 3168 |
24.97%
|
1060 |
59.06%
|
|
|
|
743 - The MTM Machine | 2082 |
43.71%
|
866 |
72.86%
|
|
|
|
10854 - Number of Paths | 1475 |
48.95%
|
653 |
83.46%
|
|
|
|
11070 - The Good Old Times | 981 |
54.03%
|
449 |
86.86%
|
|
|
|
11291 - Smeech | 1360 |
46.25%
|
535 |
89.53%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |