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 | 10979 |
33.08%
|
2445 |
67.89%
|
|
![]() |
760 - DNA Sequencing | 11458 |
26.83%
|
2177 |
79.01%
|
|
![]() |
1223 - Editor | 2481 |
57.64%
|
883 |
89.47%
|
|
![]() |
1254 - Top 10 | 1347 |
42.91%
|
264 |
86.36%
|
|
![]() |
11107 - Life Forms | 10373 |
27.91%
|
1228 |
77.28%
|
|
![]() |
11512 - GATTACA | 9429 |
45.70%
|
2435 |
85.63%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 6 of 6 |