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 | 19469 |
45.61%
|
4595 |
90.60%
|
|
|
1229 - Sub-dictionary | 2975 |
27.26%
|
553 |
68.72%
|
|
|
|
10731 - Test | 3787 |
43.41%
|
1286 |
88.57%
|
|
|
|
11504 - Dominos | 25447 |
31.34%
|
5506 |
79.99%
|
|
|
|
11709 - Trust groups | 6818 |
52.04%
|
2047 |
90.77%
|
|
|
|
11770 - Lighting Away | 7845 |
43.37%
|
2007 |
88.29%
|
|
|
|
11838 - Come and Go | 9998 |
66.19%
|
3727 |
97.37%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |