Problem N: 马的遍历

Problem N: 马的遍历

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 448  Solved: 169
[Submit] [Status] [Web Board] [Creator:]

Description

中国象棋半张棋盘如图所示，马自左下角往右上角跳，今规定只许往右跳，不许往左跳，比如图中为一种跳马路线，并将所经路线打印出来。
打印格式：(0,0) ->(2,1) ->(3,3) ->(1,4)->(3,5)->(2,7)->(4,8)
tle="" align="" />

Input

输入2个数

Output

请输出跳跃的路线，只允许往右跳。

Sample Input Copy 

4,8

Sample Output Copy 

1:(0,0)->(2,1)->(4,2)->(3,4)->(4,6)->(2,7)->(4,8)
2:(0,0)->(2,1)->(4,2)->(3,4)->(1,5)->(3,6)->(4,8)
3:(0,0)->(2,1)->(4,2)->(3,4)->(1,5)->(2,7)->(4,8)
4:(0,0)->(2,1)->(4,2)->(2,3)->(4,4)->(3,6)->(4,8)
5:(0,0)->(2,1)->(4,2)->(2,3)->(4,4)->(2,5)->(4,6)->(2,7)->(4,8)
6:(0,0)->(2,1)->(4,2)->(2,3)->(4,4)->(2,5)->(0,6)->(2,7)->(4,8)
7:(0,0)->(2,1)->(4,2)->(2,3)->(3,5)->(2,7)->(4,8)
8:(0,0)->(2,1)->(4,2)->(2,3)->(1,5)->(3,6)->(4,8)
9:(0,0)->(2,1)->(4,2)->(2,3)->(1,5)->(2,7)->(4,8)
10:(0,0)->(2,1)->(4,2)->(2,3)->(0,4)->(2,5)->(4,6)->(2,7)->(4,8)
11:(0,0)->(2,1)->(4,2)->(2,3)->(0,4)->(2,5)->(0,6)->(2,7)->(4,8)
12:(0,0)->(2,1)->(3,3)->(2,5)->(4,6)->(2,7)->(4,8)
13:(0,0)->(2,1)->(3,3)->(2,5)->(0,6)->(2,7)->(4,8)
14:(0,0)->(2,1)->(3,3)->(1,4)->(3,5)->(2,7)->(4,8)
15:(0,0)->(2,1)->(3,3)->(1,4)->(0,6)->(2,7)->(4,8)
16:(0,0)->(2,1)->(1,3)->(3,4)->(4,6)->(2,7)->(4,8)
17:(0,0)->(2,1)->(1,3)->(3,4)->(1,5)->(3,6)->(4,8)
18:(0,0)->(2,1)->(1,3)->(3,4)->(1,5)->(2,7)->(4,8)
19:(0,0)->(2,1)->(1,3)->(2,5)->(4,6)->(2,7)->(4,8)
20:(0,0)->(2,1)->(1,3)->(2,5)->(0,6)->(2,7)->(4,8)
21:(0,0)->(2,1)->(0,2)->(2,3)->(4,4)->(3,6)->(4,8)
22:(0,0)->(2,1)->(0,2)->(2,3)->(4,4)->(2,5)->(4,6)->(2,7)->(4,8)
23:(0,0)->(2,1)->(0,2)->(2,3)->(4,4)->(2,5)->(0,6)->(2,7)->(4,8)
24:(0,0)->(2,1)->(0,2)->(2,3)->(3,5)->(2,7)->(4,8)
25:(0,0)->(2,1)->(0,2)->(2,3)->(1,5)->(3,6)->(4,8)
26:(0,0)->(2,1)->(0,2)->(2,3)->(1,5)->(2,7)->(4,8)
27:(0,0)->(2,1)->(0,2)->(2,3)->(0,4)->(2,5)->(4,6)->(2,7)->(4,8)
28:(0,0)->(2,1)->(0,2)->(2,3)->(0,4)->(2,5)->(0,6)->(2,7)->(4,8)
29:(0,0)->(2,1)->(0,2)->(1,4)->(3,5)->(2,7)->(4,8)
30:(0,0)->(2,1)->(0,2)->(1,4)->(0,6)->(2,7)->(4,8)
31:(0,0)->(1,2)->(3,3)->(2,5)->(4,6)->(2,7)->(4,8)
32:(0,0)->(1,2)->(3,3)->(2,5)->(0,6)->(2,7)->(4,8)
33:(0,0)->(1,2)->(3,3)->(1,4)->(3,5)->(2,7)->(4,8)
34:(0,0)->(1,2)->(3,3)->(1,4)->(0,6)->(2,7)->(4,8)
35:(0,0)->(1,2)->(2,4)->(3,6)->(4,8)
36:(0,0)->(1,2)->(0,4)->(2,5)->(4,6)->(2,7)->(4,8)
37:(0,0)->(1,2)->(0,4)->(2,5)->(0,6)->(2,7)->(4,8)

HINT

所有标点符号全部位英文状态下的, 规定的方向为dx[4]={2,1,-1,-2},dy[4]={1,2,2,1}


int dx[4]={2,1,-1,-2};
int dy[4]={1,2,2,1};
void dfs(int x,int y)
{
if(x==n&&y==m)
{
    cout<<k<<":";
    k++;


    return;
}
for(int i=0;i<=3;i++)
{
    int nx=x+dx[i];
    int ny=y+dy[i];

}
}
int main()
{
scanf("%d,%d",&n,&m);
    b[0][0]=1;
    l[0][1]=0;l[0][2]=0;
    dfs(0,0);
return 0;
}
[Submit][Status]