This is one of 11 weekly problem sets. Each one is worth 10% of the grade of the "Submitted Implementation" evaluation criteria.
- Date of publication: 07/02/2026
- Date of delivery (deadline): 23h59m of 14/02/2026 (-2% for each extra day)
- Topics: Computational Geometry (points, lines, polygons, intersections, areas, inclusion, convex hull)
6 proposed problems:
- [Mooshak PC052] - Sunny Mountains
(tested in C++, Java and Python)
Hints
- simple line intersection, euclidean distances
- [Mooshak PC053] - Gleaming the Cubes
(tested in C++, Java and Python)
Hints
- cube intersection
- [Mooshak PC054] - Berry Picking
(tested in C++, Java and Python)
Hints
- polygon-line intersection, sort
- [Mooshak PC055] - SCUD Busters
(tested in C++, Java and Python)
Hints
- convex hull, point in polygon, polygon area
- [Mooshak PC055] - The Art Gallery
(tested in C++, Java and Python)
Hints
- polygon convexity
- [Mooshak PC057] - The Closest Pair Problem
(tested in C++, Java and Python)
Hints
- distances, divide and conquer
About the delivery:
- I will automatically catch your submissions from Codeforces (as well as in Mooshak).
- At the end of the semester you will need to send all your submitted code to me.
- You can chat and discuss the problems among yourselves, but you should do your own implementation (simply copying code from other or from an LLM is considered a severe break of the code of conduct).
- The final code submitted to should include comments with the temporal and spatial complexity, as well as a small explanation of your algorithmic idea. You should also refer any helps you got (including referencing any sources you have consulted).
Pedro Ribeiro - DCC/FCUP | Last update:
