程序控

IPPP (Institute of Penniless Peasent-Programmer) Fellow

  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: :: 管理 ::

2010年8月20日

摘要: Problem问题Consider a grid such as the one shown. We wish to mark k intersections in each of n rows and n columns in such a way that no 4 of the selected intersections form a rectangle with sides parall... 阅读全文
posted @ 2010-08-20 23:40 Devymex 阅读(1585) 评论(0) 推荐(0) 编辑

摘要: Time limit: 3.000 seconds限时:3.000秒Problem问题Consider objects such as these. They are polygons, specified by the coordinates of a centre of mass and their vertices. In the figure, centres of mass are sh... 阅读全文
posted @ 2010-08-20 19:26 Devymex 阅读(1376) 评论(0) 推荐(0) 编辑

摘要: Time limit: 3.000 seconds限时:3.000秒Problem问题Given two convex polygons, they may or may not overlap. If they do overlap, they will do so to differing degrees and in different ways. Write a program that ... 阅读全文
posted @ 2010-08-20 14:12 Devymex 阅读(3098) 评论(4) 推荐(1) 编辑