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 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Graph :: Graph Traversal :: Finding Strongly Connected Components
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
247 - Calling Circles | 19698 |
45.61%
|
4611 |
90.59%
|
|
|
|
1229 - Sub-dictionary | 3041 |
27.00%
|
557 |
68.76%
|
|
|
|
10731 - Test | 3803 |
43.33%
|
1291 |
88.54%
|
|
|
|
11504 - Dominos | 25607 |
31.47%
|
5523 |
79.99%
|
|
|
|
11709 - Trust groups | 7001 |
51.92%
|
2065 |
90.70%
|
|
|
|
11770 - Lighting Away | 7963 |
43.33%
|
2018 |
88.31%
|
|
|
|
11838 - Come and Go | 10089 |
66.18%
|
3746 |
97.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |
Browse Problems 

