zoj1091 Knight Moves

1. //zoj1091 Knight Moves
2. //Accepted 1091 C ++ 00:00.04 396K
3. #include <stdio.h>
4. #include <string.h>
5. char sb[3],se[3];
6. const int dir[8][2]={{-2,-1},{-2,1},{-1,-2},{-1,2},{1,-2},{1,2},{2,-1},{2,1}};
7. int inside(int x,int y)
8. {
9.        if (x>=0 && x<8 && y>=0 && y<8) return 1;
10.        return 0;
11. }
12. void solve()
13. {
14.        int cnt[8][8];
15.        int step = 0;
16.        int by=sb[0]-'a',bx=sb[1]-'1',ey=se[0]-'a',ex=se[1]-'1';
17.        memset(cnt,-1,sizeof(cnt));
18.        cnt[bx][by] = 0;
19.        while (cnt[ex][ey]==-1){
20.               for (int x=0; x<8; ++x)
21.                      for (int y=0; y<8; ++y)
22.                             if (cnt[x][y]==step)
23.                                    for (int i=0; i<8; ++i){
24.                                           int tx=x+dir[i][0],ty=y+dir[i][1];
25.                                           if (inside(tx,ty)) cnt[tx][ty] = step+1;
26.                                    }
27.               step++;
28.        }
29.        printf ("To get from %s to %s takes %d knight moves./n",sb,se,step);
30.  
31. }
32. int main()
33. {
34. #ifdef ONLINE_JUDGE
35. #else
36.        freopen("1091.txt","r",stdin);
37. #endif
38.        while (scanf("%s %s",&sb,&se)!=EOF)
39.               solve();
40. #ifdef ONLINE_JUDGE
41. #else
42.        fclose(stdin);
43. #endif
44.        return 0;
45. }