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 | 19652 |
45.60%
|
4610 |
90.61%
|
|
|
|
1229 - Sub-dictionary | 3026 |
27.03%
|
556 |
68.53%
|
|
|
|
10731 - Test | 3803 |
43.33%
|
1291 |
88.54%
|
|
|
|
11504 - Dominos | 25579 |
31.46%
|
5520 |
79.98%
|
|
|
|
11709 - Trust groups | 6977 |
51.87%
|
2061 |
90.73%
|
|
|
|
11770 - Lighting Away | 7916 |
43.37%
|
2017 |
88.30%
|
|
|
|
11838 - Come and Go | 10060 |
66.20%
|
3743 |
97.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |
Browse Problems 

