要去相信，没有到不了的明天

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1151

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2813 Problem Description Lv Bu and his soldiers are facing a cruel war——Cao Cao had his best generals just miles away. There’s little time , b

题目链接： Description Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1350 Problem Description Running a taxi station is not all that simple. Apart from the obvious demand for a centralised coordination of the cabs in

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1533

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1068 Problem Description the second year of the university somebody started a study on the romantic relations between the students. The relation “r

转自：http://blog.youkuaiyun.com/qq574857122/article/details/37961201

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2255

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2063

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4751

题目链接： #include #include #include #include using namespace std; const int maxn=310; int mp[maxn][maxn]; int color[maxn]; int cx[maxn],cy[maxn]; int vis[maxn]; int nx,ny; int p,n; int find(int u) {

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2444

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2389

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2119