c0de4fun的完美算(nei)法(he)教室-我们仍不知道，那天调用的驱动的名字。

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=2717这点需要特别注意的是HDU特别坑爹，POJ上是单组数据，多点测试，HDU是一点测试，多组数据！所以在POJ上把while(cin >> N >> K)去掉也是AC的，简单的BFS#include #include #include #include #include

#include #include #include #include #include #include #include //#define INPUTusing namespace std;/** Problem:POJ2442 - Sequence Begin Time : 2nd/March/2012 1:00 p.m. End Time: 2n

#include #include #include #include #include #define INPUTusing namespace std;const int c0de4fun = 10;int x[4] = {1,-1,0,0};int y[4] = {0,0,1,-1};int maze[c0de4fun][c0de4fun];/** Proble

#include #include #include #include #include //#define INPUT//#define DBG/** Problem:POJ2488 Begin Time:8th/Mar/2012 1:30 p.m. End Time:2012-03-08 21:08:53 Test Data:见下方另一份代码，数据

#include #include #include #include #include using namespace std;/** Problem : UVA11205 - The broken pedometer Begin Time: 28th/Mar/2012 11:30 a.m. Finish Time: 29th/Mar/2012 2:14 a.

#include #include #include #include //#define DBG//#define INPUT//#define DBG1using namespace std;/** Problem: poj1198 - Solitaire Begin Time : 18:33 15th/Mar/2012 End

#include #include #include #include //#define INPUTusing namespace std;/** Problem : ZOJ1649 - Rescue Begin Time : 7:00 p.m. 17th/Mar/2012 End Time : 22:17 17th/Mar/2012 Knowledg