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) :: Graph :: Graph Traversal :: Finding Strongly Connected Components
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
247 - Calling Circles | 19803 |
45.63%
|
4635 |
90.57%
|
|
|
|
1229 - Sub-dictionary | 3172 |
26.67%
|
568 |
69.01%
|
|
|
|
10731 - Test | 3823 |
43.24%
|
1292 |
88.54%
|
|
|
|
11504 - Dominos | 25765 |
31.61%
|
5544 |
80.01%
|
|
|
|
11709 - Trust groups | 7072 |
52.09%
|
2079 |
90.76%
|
|
|
|
11770 - Lighting Away | 8043 |
43.33%
|
2030 |
88.37%
|
|
|
|
11838 - Come and Go | 10344 |
66.42%
|
3771 |
97.37%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |
Browse Problems 

