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 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Graph :: Graph Traversal :: Finding Strongly Connected Components
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
247 - Calling Circles | 19622 |
45.61%
|
4604 |
90.60%
|
|
|
1229 - Sub-dictionary | 3024 |
27.02%
|
556 |
68.53%
|
|
|
|
10731 - Test | 3802 |
43.32%
|
1290 |
88.53%
|
|
|
|
11504 - Dominos | 25560 |
31.44%
|
5512 |
79.99%
|
|
|
|
11709 - Trust groups | 6944 |
51.84%
|
2055 |
90.75%
|
|
|
|
11770 - Lighting Away | 7867 |
43.38%
|
2012 |
88.27%
|
|
|
|
11838 - Come and Go | 10036 |
66.15%
|
3736 |
97.35%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |