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 | 57723 |
23.18%
|
6553 |
69.89%
|
|
|
|
10566 - Crossed Ladders | 5715 |
49.64%
|
2059 |
94.07%
|
|
|
|
11378 - Bey Battle | 2938 |
37.10%
|
588 |
84.18%
|
|
|
11646 - Athletics Track | 2794 |
63.03%
|
1113 |
93.89%
|
|
|
|
11648 - Divide The Land | 902 |
62.75%
|
398 |
92.96%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 5 of 5 | |