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 | 19353 |
45.53%
|
4573 |
90.55%
|
|
|
1229 - Sub-dictionary | 2845 |
26.15%
|
550 |
68.55%
|
|
|
|
10731 - Test | 3776 |
43.38%
|
1284 |
88.55%
|
|
|
|
11504 - Dominos | 25227 |
31.31%
|
5489 |
80.00%
|
|
|
|
11709 - Trust groups | 6656 |
51.74%
|
2034 |
90.76%
|
|
|
|
11770 - Lighting Away | 7762 |
43.26%
|
1992 |
88.20%
|
|
|
|
11838 - Come and Go | 9840 |
66.28%
|
3704 |
97.35%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |