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 | 55297 |
23.31%
|
6409 |
69.95%
|
|
|
|
10566 - Crossed Ladders | 5477 |
49.92%
|
2007 |
94.12%
|
|
|
|
11378 - Bey Battle | 2857 |
36.33%
|
582 |
84.19%
|
|
|
11646 - Athletics Track | 2774 |
63.05%
|
1101 |
94.10%
|
|
|
|
11648 - Divide The Land | 887 |
62.68%
|
390 |
93.08%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 5 of 5 | |