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 | 18911 |
45.59%
|
4521 |
90.47%
|
|
![]() |
1229 - Sub-dictionary | 2630 |
25.82%
|
535 |
68.04%
|
|
![]() |
10731 - Test | 3739 |
43.38%
|
1275 |
88.47%
|
|
![]() |
11504 - Dominos | 24746 |
31.27%
|
5410 |
80.09%
|
|
![]() |
11709 - Trust groups | 6425 |
51.36%
|
2009 |
90.59%
|
|
![]() |
11770 - Lighting Away | 7404 |
43.60%
|
1961 |
88.27%
|
|
![]() |
11838 - Come and Go | 9342 |
66.68%
|
3637 |
97.39%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 7 of 7 |