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 | 18964 |
45.57%
|
4527 |
90.48%
|
|
|
1229 - Sub-dictionary | 2638 |
25.89%
|
535 |
68.22%
|
|
|
|
10731 - Test | 3740 |
43.40%
|
1275 |
88.47%
|
|
|
|
11504 - Dominos | 24787 |
31.27%
|
5414 |
80.11%
|
|
|
|
11709 - Trust groups | 6442 |
51.44%
|
2011 |
90.60%
|
|
|
|
11770 - Lighting Away | 7454 |
43.57%
|
1963 |
88.28%
|
|
|
|
11838 - Come and Go | 9417 |
66.63%
|
3645 |
97.39%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |