摘要：
FriendshipTime Limit:2000MSMemory Limit:20000KTotal Submissions:8025Accepted:2224DescriptionIn modern society, each person has his own friends. Since all the people are very busy, they communicate with each other only by phone. You can assume that people A can keep in touch with people B, only if1. 阅读全文
摘要：
Sightseeing tourTime Limit:1000MSMemory Limit:10000KTotal Submissions:6448Accepted:2654DescriptionThe city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so that tourists can see every corner of the beautiful city. They want to construct the tour so that every street i 阅读全文
摘要：
Perfect ElectionTime Limit:5000MSMemory Limit:65536KTotal Submissions:438Accepted:223DescriptionIn a country (my memory fails to say which), the candidates {1, 2 ..., N} are running in the parliamentary election. An opinion poll asks the question "For any two candidates of your own choice, whic 阅读全文
摘要：
Map LabelerTime Limit:1000MSMemory Limit:65536KTotal Submissions:1267Accepted:409DescriptionMap generation is a difficult task in cartography. A vital part of such task is automatic labeling of the cities in a map; where for each city there is text label to be attached to its location, so that no tw 阅读全文
摘要：
Bomb GameTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2754Accepted Submission(s): 918Problem DescriptionRobbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At each 阅读全文
摘要：
Priest John's Busiest DayTime Limit:2000MSMemory Limit:65536KTotal Submissions:6900Accepted:2363Special JudgeDescriptionJohn is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the couple who get married on that da 阅读全文
摘要：
Katu PuzzleTime Limit:1000MSMemory Limit:65536KTotal Submissions:6553Accepted:2401DescriptionKatu Puzzle is presented as a directed graphG(V,E) with each edgee(a,b) labeled by a boolean operatorop(one of AND, OR, XOR) and an integerc(0 ≤c≤ 1). One Katu is solvable if one can find each vertexVia valu 阅读全文
摘要：
WeddingTime Limit:1000MSMemory Limit:65536KTotal Submissions:6673Accepted:2033Special JudgeDescriptionUp to thirty couples will attend a wedding feast, at which they will be seated on either side of a long table. The bride and groom sit at one end, opposite each other, and the bride wears an elabora 阅读全文
摘要：
Ikki's Story IV - Panda's TrickTime Limit:1000MSMemory Limit:131072KTotal Submissions:6691Accepted:2496Descriptionliympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants to play ano 阅读全文
该文被密码保护。 阅读全文
摘要：
PartyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3120Accepted Submission(s): 974Problem Description有n对夫妻被邀请参加一个聚会，因为场地的问题，每对夫妻中只有1人可以列席。在2n 个人中，某些人之间有着很大的矛盾（当然夫妻之间是没有矛盾的），有矛盾的2个人是不会同时出现在聚会上的。有没有可能会有n 个人同时列席？Inputn： 表示有n对夫妻被邀请 (n#include#include 阅读全文