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 | 19003 |
45.55%
|
4536 |
90.50%
|
|
|
1229 - Sub-dictionary | 2673 |
25.96%
|
538 |
68.22%
|
|
|
|
10731 - Test | 3752 |
43.39%
|
1277 |
88.49%
|
|
|
|
11504 - Dominos | 24804 |
31.29%
|
5420 |
80.11%
|
|
|
|
11709 - Trust groups | 6480 |
51.39%
|
2016 |
90.62%
|
|
|
|
11770 - Lighting Away | 7473 |
43.58%
|
1966 |
88.30%
|
|
|
|
11838 - Come and Go | 9457 |
66.63%
|
3653 |
97.40%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |