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
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 | 18777 |
45.63%
|
4502 |
90.45%
|
||
1229 - Sub-dictionary | 2575 |
25.79%
|
534 |
68.16%
|
||
10731 - Test | 3734 |
43.44%
|
1274 |
88.54%
|
||
11504 - Dominos | 24648 |
31.21%
|
5396 |
80.04%
|
||
11709 - Trust groups | 6363 |
51.23%
|
1999 |
90.60%
|
||
11770 - Lighting Away | 7315 |
43.62%
|
1949 |
88.25%
|
||
11838 - Come and Go | 9198 |
66.63%
|
3612 |
97.37%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 7 of 7 |