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 | 19800 |
45.62%
|
4635 |
90.57%
|
|
|
1229 - Sub-dictionary | 3147 |
26.72%
|
567 |
68.96%
|
|
|
|
10731 - Test | 3823 |
43.24%
|
1292 |
88.54%
|
|
|
|
11504 - Dominos | 25742 |
31.59%
|
5543 |
80.01%
|
|
|
|
11709 - Trust groups | 7062 |
52.10%
|
2079 |
90.76%
|
|
|
|
11770 - Lighting Away | 8038 |
43.32%
|
2030 |
88.37%
|
|
|
|
11838 - Come and Go | 10336 |
66.42%
|
3771 |
97.37%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |