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 | 55202 |
23.30%
|
6396 |
69.93%
|
|
|
|
10566 - Crossed Ladders | 5448 |
49.87%
|
1998 |
94.09%
|
|
|
|
11378 - Bey Battle | 2725 |
36.44%
|
581 |
84.17%
|
|
|
11646 - Athletics Track | 2769 |
63.06%
|
1100 |
94.09%
|
|
|
|
11648 - Divide The Land | 887 |
62.68%
|
390 |
93.08%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 5 of 5 | |