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 | 10905 |
33.07%
|
2439 |
67.81%
|
|
![]() |
760 - DNA Sequencing | 11382 |
26.83%
|
2170 |
78.99%
|
|
![]() |
1223 - Editor | 2463 |
57.53%
|
879 |
89.42%
|
|
![]() |
1254 - Top 10 | 1341 |
42.95%
|
264 |
86.36%
|
|
![]() |
11107 - Life Forms | 10287 |
28.02%
|
1221 |
77.40%
|
|
![]() |
11512 - GATTACA | 9404 |
45.68%
|
2432 |
85.61%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 6 of 6 |