哇哈哈的专栏

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1072 Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7694    Accepted Submission(

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1240 Asteroids! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3621    Accepted Submission

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1253 胜利大逃亡 Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27502    Accepted Submission(s):

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1026 Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13266    A

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1226 超级密码 Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2759    Accepted Submission(s):

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1043 Eight Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13317    Accepted Submission(s)

#include #include #include #include using namespace std; const int maxn=105; char Map[maxn][maxn]; bool vis[maxn][maxn]; struct node { int x,y; int s; }; int n,m,sx,sy,ex,ey; int dir[][2]={ {0

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1372 Knight Moves Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7400    Accepted Submission

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1180 诡异的楼梯 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 9755    Accepted Submission(s):