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 | 57553 |
23.16%
|
6543 |
69.89%
|
|
|
|
10566 - Crossed Ladders | 5699 |
49.62%
|
2057 |
94.07%
|
|
|
|
11378 - Bey Battle | 2927 |
37.07%
|
587 |
84.16%
|
|
|
11646 - Athletics Track | 2793 |
63.01%
|
1112 |
93.88%
|
|
|
|
11648 - Divide The Land | 900 |
62.67%
|
396 |
92.93%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 5 of 5 | |