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 | 19409 |
45.59%
|
4585 |
90.58%
|
|
|
1229 - Sub-dictionary | 2944 |
27.21%
|
552 |
68.66%
|
|
|
|
10731 - Test | 3786 |
43.40%
|
1285 |
88.56%
|
|
|
|
11504 - Dominos | 25301 |
31.35%
|
5501 |
79.99%
|
|
|
|
11709 - Trust groups | 6737 |
51.97%
|
2041 |
90.79%
|
|
|
|
11770 - Lighting Away | 7827 |
43.34%
|
2003 |
88.22%
|
|
|
|
11838 - Come and Go | 9925 |
66.31%
|
3715 |
97.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |