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 | 19251 |
45.55%
|
4568 |
90.54%
|
|
![]() |
1229 - Sub-dictionary | 2816 |
26.10%
|
547 |
68.37%
|
|
![]() |
10731 - Test | 3774 |
43.35%
|
1283 |
88.54%
|
|
![]() |
11504 - Dominos | 25201 |
31.31%
|
5485 |
79.98%
|
|
![]() |
11709 - Trust groups | 6642 |
51.69%
|
2031 |
90.74%
|
|
![]() |
11770 - Lighting Away | 7748 |
43.21%
|
1989 |
88.19%
|
|
![]() |
11838 - Come and Go | 9799 |
66.22%
|
3696 |
97.35%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 7 of 7 |