ACM,再见！

http://poj.org/problem?id=1947

http://acm.hdu.edu.cn/showproblem.php?pid=2196Problem DescriptionA school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 n

http://acm.hdu.edu.cn/showproblem.php?pid=4276Problem DescriptionMy name is Hu Bayi, robing an ancient tomb in Tibet. The tomb consists of N rooms (numbered from 1 to N) which are connecte

http://acm.hdu.edu.cn/showproblem.php?pid=3534Problem DescriptionIn the Data structure class of HEU, the teacher asks one problem: How to find the longest path of one tree and the number

http://acm.hdu.edu.cn/showproblem.php?pid=4118Problem DescriptionNowadays, people have many ways to save money on accommodation when they are on vacation.One of these ways is exchanging ho

http://poj.org/problem?id=1655DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. D

http://acm.hdu.edu.cn/showproblem.php?pid=4274Problem DescriptionI'm a manager of a large trading company, called ACM, and responsible for the market research. Recently, another trading comp

http://poj.org/problem?id=1741DescriptionGive a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and v. Give a

http://acm.hdu.edu.cn/showproblem.php?pid=4123Problem DescriptionBob wants to hold a race to encourage people to do sports. He has got trouble in choosing the route. There are N houses and N

http://acm.hdu.edu.cn/showproblem.php?pid=5379Problem DescriptionLittle sun is an artist. Today he is playing mahjong alone. He suddenly feels that the tree in the yard doesn't look good. So

http://acm.hdu.edu.cn/showproblem.php?pid=4616Problem Description　　Nowadays, there are more and more challenge game on TV such as 'Girls, Rush Ahead'. Now, you participate int a game like th

http://acm.hdu.edu.cn/showproblem.php?pid=1520Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchic

http://acm.hdu.edu.cn/showproblem.php?pid=3586Problem DescriptionIn the battlefield , an effective way to defeat enemies is to break their communication system.The information department t

http://acm.hdu.edu.cn/showproblem.php?pid=4044Problem DescriptionTower defense is a kind of real-time strategy computer games. The goal of tower defense games is to try to stop enemies f

http://poj.org/problem?id=2342

http://acm.hdu.edu.cn/showproblem.php?pid=5001

http://codeforces.com/problemset/problem/23/EE. Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

http://acm.hdu.edu.cn/showproblem.php?pid=4003Problem DescriptionHumans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connecting each of

http://acm.hdu.edu.cn/showproblem.php?pid=4340Problem DescriptionAnt and Bob two army want to capture a country. The country is consist of N cities. To capture the city i, it takes Ant A

http://acm.hdu.edu.cn/showproblem.php?pid=1520Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierar

http://acm.hdu.edu.cn/showproblem.php?pid=1054Problem DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then

http://acm.hdu.edu.cn/showproblem.php?pid=1011Problem DescriptionYou, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a

http://poj.org/problem?id=3107DescriptionLast years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arre

http://acm.hdu.edu.cn/showproblem.php?pid=1561Problem DescriptionACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因，有些城堡不能直接攻克，要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy

http://codeforces.com/problemset/problem/581/FF. Zublicanes and Mumocratestime limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputs