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: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 7. (Computational) Geometry :: Divide and Conquer Revisited
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
10245 - The Closest Pair Problem | 56991 |
23.20%
|
6523 |
69.94%
|
|
|
|
10566 - Crossed Ladders | 5691 |
49.60%
|
2053 |
94.11%
|
|
|
|
11378 - Bey Battle | 2905 |
36.90%
|
585 |
84.27%
|
|
|
11646 - Athletics Track | 2789 |
63.03%
|
1109 |
93.96%
|
|
|
|
11648 - Divide The Land | 898 |
62.69%
|
394 |
93.15%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 5 of 5 | |