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 | 11352 |
33.67%
|
2513 |
68.60%
|
|
![]() |
760 - DNA Sequencing | 11723 |
26.75%
|
2212 |
79.07%
|
|
![]() |
1223 - Editor | 2630 |
57.34%
|
906 |
89.51%
|
|
![]() |
1254 - Top 10 | 1365 |
42.93%
|
267 |
86.52%
|
|
![]() |
11107 - Life Forms | 10827 |
27.46%
|
1285 |
76.89%
|
|
![]() |
11512 - GATTACA | 9552 |
45.64%
|
2468 |
85.58%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 6 of 6 |