杭电1372--Knight Moves(BFS)
来源:互联网 发布:数据采集卡原理设计 编辑:程序博客网 时间:2024/05/22 12:56
Of course you know that it is vice versa. So you offer him to writea program that solves the "difficult" part.
Your job is to write a program that takes two squares a and b asinput and then determines the number of knight moves on a shortestroute from a to b.
# include<stdio.h>
# include<string.h>
int mark[10][10],x1,y1,x2,y2;
int dir[8][2]={-2,1,-1,2,1,2,2,1,2,-1,1,-2,-1,-2,-2,-1};
char s1[5],s2[5];
struct node{
};
struct node queue[100];
int bfs()
{
}
int main()
{
}
- 杭电1372--Knight Moves(BFS)
- 杭电--1372 Knight Moves (经典BFS)
- 杭电 1372 Knight Moves
- 杭电1372-Knight Moves
- 杭电 1372 Knight Moves
- 1372 knight moves BFS
- Knight Moves(bfs)
- Knight Moves(BFS)
- Knight Moves(BFS)
- Knight Moves (BFS)
- 杭电ACM1372——Knight Moves~~BFS
- 【hdu 1372】 Knight Moves (BFS)
- hdu 1372 Knight Moves (水bfs)
- hdu 1372 Knight Moves(BFS)
- Hdu 1372 Knight Moves(BFS)
- HDU 1372 Knight Moves (BFS)
- hdu 1372 Knight Moves(bfs)
- HDU-#1372 Knight Moves(双向BFS)
- PHP 字符串
- poj1226--Substrings
- 杭电1753--大明A+B
- poj1181--变形课(BFS)
- 杭电1198--Farm Irrigation(BFS外…
- 杭电1372--Knight Moves(BFS)
- poj1321--棋盘问题(DFS)
- 杭电1242--Rescue(BFS+优先队列)
- 黑马程序员-day05-面向对象(封装 Encapsulation)
- 杭电1159——Common Subsequence
- 杭电1087--Super Jumping! Jumping…
- iOS中Block介绍(一)基础
- 杭电1059--Dividing(多重背包一)
- 杭电2602--Bone Collector(01背包…