Browse Problems 
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
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
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 | 18749 |
45.66%
|
4501 |
90.45%
|
|
|
1229 - Sub-dictionary | 2563 |
25.91%
|
533 |
68.29%
|
|
|
|
10731 - Test | 3734 |
43.44%
|
1274 |
88.54%
|
|
|
|
11504 - Dominos | 24460 |
31.26%
|
5377 |
79.99%
|
|
|
|
11709 - Trust groups | 6326 |
51.30%
|
1999 |
90.60%
|
|
|
|
11770 - Lighting Away | 7288 |
43.59%
|
1945 |
88.38%
|
|
|
|
11838 - Come and Go | 9171 |
66.61%
|
3607 |
97.37%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |