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 :: String Comparison
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
409 - Excuses, Excuses! | 19238 |
33.12%
|
5254 |
83.02%
|
|
|
|
644 - Immediate Decodability | 16617 |
44.03%
|
5171 |
91.36%
|
|
|
|
671 - Spell checker | 4173 |
24.99%
|
971 |
66.12%
|
|
|
|
912 - Live From Mars | 1162 |
24.53%
|
353 |
60.06%
|
|
|
|
11048 - Automatic Correction of Misspellings | 2628 |
37.63%
|
813 |
81.43%
|
|
|
|
11056 - Formula 1 | 4392 |
34.11%
|
1340 |
88.06%
|
|
|
|
11233 - Deli Deli | 7306 |
60.09%
|
3209 |
97.13%
|
|
|
|
11713 - Abstract Names | 12792 |
54.97%
|
5129 |
95.32%
|
|
|
|
11734 - Big Number of Teams will Solve This | 11703 |
42.39%
|
3825 |
91.01%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |
Browse Problems 

