Browse Problems 
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
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
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 | 18889 |
45.59%
|
4516 |
90.46%
|
|
|
1229 - Sub-dictionary | 2626 |
25.86%
|
534 |
68.16%
|
|
|
|
10731 - Test | 3739 |
43.38%
|
1275 |
88.47%
|
|
|
|
11504 - Dominos | 24735 |
31.27%
|
5407 |
80.08%
|
|
|
|
11709 - Trust groups | 6401 |
51.41%
|
2005 |
90.57%
|
|
|
|
11770 - Lighting Away | 7377 |
43.58%
|
1956 |
88.24%
|
|
|
|
11838 - Come and Go | 9307 |
66.72%
|
3628 |
97.38%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |