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 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 | 19716 |
45.62%
|
4615 |
90.60%
|
|
|
|
1229 - Sub-dictionary | 3064 |
27.02%
|
559 |
68.87%
|
|
|
|
10731 - Test | 3809 |
43.29%
|
1291 |
88.54%
|
|
|
|
11504 - Dominos | 25652 |
31.53%
|
5531 |
80.02%
|
|
|
|
11709 - Trust groups | 7016 |
52.00%
|
2067 |
90.71%
|
|
|
|
11770 - Lighting Away | 7978 |
43.32%
|
2020 |
88.32%
|
|
|
|
11838 - Come and Go | 10224 |
66.34%
|
3752 |
97.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |
Browse Problems 

