Usher_Ou的博客

最少步数 时间限制：3000 ms  |  内存限制：65535 KB 难度：4 描述 这有一个迷宫，有0~8行和0~8列：  1,1,1,1,1,1,1,1,1  1,0,0,1,0,0,1,0,1  1,0,0,1,1,0,0,0,1  1,0,1,0,1,1,0,1,1  1,0,0,0,0,1,0,0,1  1,1,0,1,0,1,0,0,1

坦克大战 时间限制：1000 ms  |  内存限制：65535 KB 难度：3 描述 Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now.  What we are dis

DFS模板 #include<cstdio> #include<cstring> #include<cstdlib> using namespace std; const int maxn=100; bool vst[maxn][maxn]; // 访问标记 int map[maxn][maxn]; // 坐标范围 int dir[4][2]= {0,1,0,-1,1,0,-1,0}; // 方向向

Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 87429 Accepted: 27431 Description Farmer John has been informed of the location of a fugitive cow and

Dungeon Master Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 32421   Accepted: 12431 Description You are trapped in a 3D dungeon and need to find the quick

迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20612 Accepted: 12062 Description 定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0

Shuffle'm Up Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10637   Accepted: 4918 Description A common pastime for poker players at a poker table is to s