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 | 19770 |
45.64%
|
4631 |
90.56%
|
|
|
1229 - Sub-dictionary | 3137 |
26.71%
|
565 |
68.85%
|
|
|
|
10731 - Test | 3819 |
43.26%
|
1292 |
88.54%
|
|
|
|
11504 - Dominos | 25693 |
31.54%
|
5542 |
80.01%
|
|
|
|
11709 - Trust groups | 7051 |
52.08%
|
2076 |
90.75%
|
|
|
|
11770 - Lighting Away | 8032 |
43.29%
|
2028 |
88.36%
|
|
|
|
11838 - Come and Go | 10310 |
66.39%
|
3765 |
97.37%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |