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 | 6322 |
47.96%
|
2052 |
83.87%
|
|
|
|
464 - Sentence/Phrase Generator | 1866 |
32.21%
|
525 |
72.19%
|
|
|
|
620 - Cellular Structure | 4116 |
53.06%
|
1837 |
86.83%
|
|
|
|
622 - Grammar Evaluation | 3184 |
25.22%
|
1066 |
59.19%
|
|
|
|
743 - The MTM Machine | 2097 |
43.68%
|
869 |
72.84%
|
|
|
|
10854 - Number of Paths | 1522 |
48.75%
|
663 |
83.41%
|
|
|
|
11070 - The Good Old Times | 995 |
54.27%
|
454 |
86.78%
|
|
|
|
11291 - Smeech | 1374 |
46.43%
|
542 |
89.30%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |