HDU 1026 Ignatius and the Princess I(BFS)

摘要： 题目连接：http://acm.hdu.edu.cn/showproblem.php?pid=1026在这博客学的 ttp://www.wutianqi.com/?p=2354感觉看了这个之后收获良多#include <queue>#include <stack>#include <cstdio>#include <iostream>#include <string.h>#include <algorithm>using namespace std;typedef struct node{ int x,y,dis; int 阅读全文
posted @ 2012-03-29 22:46 江财小子 阅读(147) 评论(0) 推荐(0)

3006 HDU The Number of set

摘要： http://www.cnblogs.com/lonelycatcher/archive/2011/05/27/2060158.htmlGiven you n sets.All positive integers in sets are not less than 1 and not greater than m.If use these sets to combinate the new set,how many different new set you can get.The given sets can not be broken.InputThere are several case 阅读全文
posted @ 2012-03-29 17:06 江财小子 阅读(232) 评论(0) 推荐(0)