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 | 6303 |
47.95%
|
2047 |
83.93%
|
|
|
|
464 - Sentence/Phrase Generator | 1858 |
32.02%
|
519 |
72.06%
|
|
|
|
620 - Cellular Structure | 4086 |
53.06%
|
1831 |
86.84%
|
|
|
|
622 - Grammar Evaluation | 3170 |
25.02%
|
1061 |
59.10%
|
|
|
|
743 - The MTM Machine | 2082 |
43.71%
|
866 |
72.86%
|
|
|
|
10854 - Number of Paths | 1485 |
48.75%
|
654 |
83.49%
|
|
|
|
11070 - The Good Old Times | 983 |
54.12%
|
450 |
86.89%
|
|
|
|
11291 - Smeech | 1362 |
46.26%
|
536 |
89.55%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 8 of 8 | |