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 | 19408 |
45.59%
|
4584 |
90.58%
|
|
|
1229 - Sub-dictionary | 2943 |
27.18%
|
552 |
68.66%
|
|
|
|
10731 - Test | 3786 |
43.40%
|
1285 |
88.56%
|
|
|
|
11504 - Dominos | 25282 |
31.35%
|
5498 |
80.01%
|
|
|
|
11709 - Trust groups | 6685 |
51.85%
|
2040 |
90.78%
|
|
|
|
11770 - Lighting Away | 7825 |
43.32%
|
2002 |
88.16%
|
|
|
|
11838 - Come and Go | 9921 |
66.30%
|
3714 |
97.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |