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
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 | 6323 |
47.97%
|
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 | 3197 |
25.34%
|
1066 |
59.19%
|
|
|
|
743 - The MTM Machine | 2099 |
43.74%
|
870 |
72.87%
|
|
|
|
10854 - Number of Paths | 1530 |
48.82%
|
664 |
83.43%
|
|
|
|
11070 - The Good Old Times | 997 |
54.36%
|
455 |
86.81%
|
|
|
|
11291 - Smeech | 1377 |
46.41%
|
543 |
89.13%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |
Browse Problems 

