Browse Problems 
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 | 6220 |
47.80%
|
2034 |
83.78%
|
|
|
|
464 - Sentence/Phrase Generator | 1847 |
32.11%
|
518 |
72.01%
|
|
|
|
620 - Cellular Structure | 4062 |
53.10%
|
1823 |
86.89%
|
|
|
|
622 - Grammar Evaluation | 3153 |
24.83%
|
1056 |
58.81%
|
|
|
|
743 - The MTM Machine | 2073 |
43.66%
|
864 |
72.80%
|
|
|
|
10854 - Number of Paths | 1431 |
48.85%
|
641 |
83.15%
|
|
|
|
11070 - The Good Old Times | 975 |
53.85%
|
447 |
86.80%
|
|
|
|
11291 - Smeech | 1328 |
46.16%
|
531 |
89.64%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |