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 | 19721 |
45.61%
|
4618 |
90.56%
|
|
|
|
1229 - Sub-dictionary | 3082 |
26.90%
|
559 |
68.87%
|
|
|
|
10731 - Test | 3809 |
43.29%
|
1291 |
88.54%
|
|
|
|
11504 - Dominos | 25671 |
31.53%
|
5534 |
80.01%
|
|
|
|
11709 - Trust groups | 7020 |
51.99%
|
2067 |
90.71%
|
|
|
|
11770 - Lighting Away | 7978 |
43.32%
|
2020 |
88.32%
|
|
|
|
11838 - Come and Go | 10232 |
66.30%
|
3752 |
97.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |
Browse Problems 

