Ramanujan

摘要： AntsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 3709Accepted: 1125Special JudgeDescriptionYoung naturalist Bill studies ants in school. His ants feed on plant-louses that live on apple trees. Each ant colony needs its own apple tree to feed itself.Bill has a map with coordinates of n an 阅读全文

摘要： 奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2350Accepted Submission(s): 1028Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。另一方面,村长和 阅读全文

摘要： 转自：http://www.cppblog.com/Felicia/category/4905.html?Show=All计算几何[计算几何]pku1444 长方体旋转 摘要: 用递归旋转法解决长方体表面点的最近表面距离 阅读全文posted @ 2008-01-23 21:07 Felicia 阅读(955) | 评论 (2) 编辑 [计算几何]pku3293 摘要: 先按规则连。规则是隔一段连一个。比如一条直线上有6个点，就1-2，3-4，5-6，这么连。如果只有奇数个点，就不行。然后再判有没有洞。 方法是任选一个点，走一圈，看看是否遍历所有的点。 阅读全文posted @ 2... 阅读全文

摘要： 网络流题目集锦(by 戴神)转载自 daizhy_acm最终编辑 AekdyCoin最大流 POJ 1273 Drainage Ditches POJ 1274 The Perfect Stall (二分图匹配) POJ 1698 Alice's Chance POJ 1459 Power Network POJ 2112 Optimal Milking (二分) POJ 2455 Secret Milking Machine (二分) POJ 3189 Steady Cow Assignment (枚举) POJ 1637 Sightseeing tour (混合图欧拉回路)... 阅读全文

摘要： The Bandulu Space Agency (BSA) has plans for the following three space missions:Mission A: Landing on Ganymede, the largest moon of Jupiter.Mission B: Landing on Callisto, the second largest moon of Jupiter.Mission C: Landing on Titan, the largest moon of Saturn.Your task is to assign a crew for eac 阅读全文

摘要： As you must have experienced, instead of landing immediately, an aircraft sometimes waits in a holding loop close to the runway. This holding mechanism is required by air traffic controllers to space apart aircraft as much as possible on the runway (while keeping delays low). It is formally defined 阅读全文

摘要： Problem B: The Largest CliqueGiven a directed graph G, consider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Create a directed edge between two vertices u and v in T(G) if and only if there is a path between u and v in G that follows the directed edg 阅读全文

摘要： Mining Your Own BusinessTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 769Accepted Submission(s): 97Problem DescriptionJohn Digger is the owner of a large illudium phosdex mine. The mine is made up of a series of tunnels that meet at various large 阅读全文

摘要： Consider the following exercise, found in a generic linear algebra textbook.Let A be an n × n matrix. Prove that the following statements are equivalent:A is invertible.Ax = b has exactly one solution for every n × 1 matrix b.Ax = b is consistent for every n × 1 matrix b.Ax = 0 has on 阅读全文

摘要： Knights of the Round TableTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 8288Accepted: 2632DescriptionBeing a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things to do. Therefore, it is not very su 阅读全文