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 | 11002 |
33.10%
|
2451 |
67.97%
|
|
|
|
760 - DNA Sequencing | 11487 |
26.85%
|
2181 |
79.00%
|
|
|
|
1223 - Editor | 2570 |
57.28%
|
889 |
89.54%
|
|
|
|
1254 - Top 10 | 1349 |
42.92%
|
264 |
86.36%
|
|
|
|
11107 - Life Forms | 10433 |
27.97%
|
1232 |
77.35%
|
|
|
|
11512 - GATTACA | 9461 |
45.63%
|
2436 |
85.63%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |