PUMaC 2007 · 几何（A 组） · 第 7 题
PUMaC 2007 — Geometry (Division A) — Problem 7
题目详情
- A set of points P covers a polygon if for every point in the polygon, a line can be drawn inside the i polygon to at least one P . Points A , A , . . . , A in the plane form a 2007-gon, not necessarily i 1 2 n convex. Find the minimum value of n such that for any such polygon, we can pick n points inside it that cover the polygon. 2 2 2 2
解析
暂无解答链接。
Original Explanation
No solutions link available.