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 | 19761 |
45.63%
|
4628 |
90.56%
|
|
|
1229 - Sub-dictionary | 3130 |
26.71%
|
565 |
68.85%
|
|
|
|
10731 - Test | 3813 |
43.30%
|
1292 |
88.54%
|
|
|
|
11504 - Dominos | 25689 |
31.53%
|
5539 |
80.00%
|
|
|
|
11709 - Trust groups | 7046 |
52.06%
|
2074 |
90.74%
|
|
|
|
11770 - Lighting Away | 8019 |
43.32%
|
2026 |
88.35%
|
|
|
|
11838 - Come and Go | 10299 |
66.39%
|
3762 |
97.37%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |