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 :: Suffix Trie, Tree, Array :: Standard
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
719 - Glass Beads | 11578 |
34.05%
|
2573 |
69.18%
|
|
|
|
760 - DNA Sequencing | 11973 |
26.74%
|
2236 |
79.11%
|
|
|
|
1223 - Editor | 2753 |
57.86%
|
927 |
89.64%
|
|
|
|
1254 - Top 10 | 1424 |
42.63%
|
278 |
85.97%
|
|
|
|
11107 - Life Forms | 11094 |
27.74%
|
1305 |
76.78%
|
|
|
|
11512 - GATTACA | 9707 |
45.88%
|
2488 |
85.69%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |
Browse Problems 

