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 | 19738 |
45.62%
|
4625 |
90.55%
|
|
|
1229 - Sub-dictionary | 3107 |
26.84%
|
561 |
68.98%
|
|
|
|
10731 - Test | 3812 |
43.28%
|
1292 |
88.54%
|
|
|
|
11504 - Dominos | 25685 |
31.53%
|
5538 |
79.99%
|
|
|
|
11709 - Trust groups | 7036 |
52.03%
|
2071 |
90.73%
|
|
|
|
11770 - Lighting Away | 8011 |
43.29%
|
2024 |
88.34%
|
|
|
|
11838 - Come and Go | 10284 |
66.37%
|
3761 |
97.37%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |