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 | 19511 |
45.65%
|
4598 |
90.58%
|
|
|
1229 - Sub-dictionary | 3009 |
27.12%
|
556 |
68.53%
|
|
|
|
10731 - Test | 3802 |
43.32%
|
1290 |
88.53%
|
|
|
|
11504 - Dominos | 25471 |
31.37%
|
5508 |
79.97%
|
|
|
|
11709 - Trust groups | 6831 |
52.03%
|
2049 |
90.73%
|
|
|
|
11770 - Lighting Away | 7863 |
43.35%
|
2009 |
88.25%
|
|
|
|
11838 - Come and Go | 10012 |
66.17%
|
3731 |
97.35%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |