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 :: Suffix Trie, Tree, Array :: Standard
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
719 - Glass Beads | 11480 |
33.88%
|
2542 |
68.88%
|
|
|
|
760 - DNA Sequencing | 11912 |
26.69%
|
2226 |
79.02%
|
|
|
|
1223 - Editor | 2710 |
57.49%
|
916 |
89.52%
|
|
|
|
1254 - Top 10 | 1413 |
42.46%
|
275 |
85.82%
|
|
|
|
11107 - Life Forms | 11025 |
27.72%
|
1297 |
76.72%
|
|
|
|
11512 - GATTACA | 9625 |
45.79%
|
2482 |
85.62%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |