振兴中华

代码(dfs)

#include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<cstring>
#include<algorithm>

using namespace std;

const int dir[4][2] = {{-1,0},{0,-1},{0,1},{1,0}};
int mmap[5][6];
int cnt;

int recx[9];
int recy[9];
int dfs(int x,int y,int v);//当前点为(x,y),且值为v
int main()
{
    freopen("2.txt","w",stdout);
    /*貌似表格中的数据可以抽象成一个类似于循环的环*/
    int i,j;
    for(i = 1; i < 5; ++i)
    {
        for(j = 1; j < 6; ++j)
        {
            mmap[i][j] = j + (i - 1);
        }
    }

 /*   for(i = 1; i < 5; ++i)
    {
        for(j = 1; j < 6; ++j)
        {
            cout << mmap[i][j] << "  ";
        }
        cout << endl;
    }*/

    dfs(1,1,1);
    cout << cnt << endl;
    return 0;
}
inline bool valid(int x,int y)
{
    return (x >= 1 && x <= 4 && y >= 1 && y <= 5);
}
int dfs(int x,int y,int v)
{
    recx[v] = x;
    recy[v] = y;
    if(v == 8)
    {
        cout << "report coordinate\n";
        for(int i = 1; i < 9; ++i)
        {
            printf("( %d , %d }\n",recx[i],recy[i]);
        }
        ++cnt;
        return 0;
    }
    int tmpx,tmpy;
    for(int i = 0; i < 4; ++i)
    {
        tmpx = x + dir[i][0];
        tmpy = y + dir[i][1];
        if(valid(tmpx,tmpy))
        {
           // cout <<"ever"<<endl;
            if(mmap[tmpx][tmpy] == v + 1)
            {
                dfs(tmpx,tmpy,v+1);
            }
        }
    }
    return 0;
}

运行结果~

report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 1 , 4 }
( 1 , 5 }
( 2 , 5 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 1 , 4 }
( 2 , 4 }
( 2 , 5 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 1 , 4 }
( 2 , 4 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 1 , 4 }
( 2 , 4 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 2 , 3 }
( 2 , 4 }
( 2 , 5 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 2 , 3 }
( 2 , 4 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 2 , 3 }
( 2 , 4 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 2 , 3 }
( 3 , 3 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 2 , 3 }
( 3 , 3 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 1 , 3 }
( 2 , 3 }
( 3 , 3 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 2 , 3 }
( 2 , 4 }
( 2 , 5 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 2 , 3 }
( 2 , 4 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 2 , 3 }
( 2 , 4 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 2 , 3 }
( 3 , 3 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 2 , 3 }
( 3 , 3 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 2 , 3 }
( 3 , 3 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 3 , 2 }
( 3 , 3 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 3 , 2 }
( 3 , 3 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 3 , 2 }
( 3 , 3 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 1 , 2 }
( 2 , 2 }
( 3 , 2 }
( 4 , 2 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 2 , 3 }
( 2 , 4 }
( 2 , 5 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 2 , 3 }
( 2 , 4 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 2 , 3 }
( 2 , 4 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 2 , 3 }
( 3 , 3 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 2 , 3 }
( 3 , 3 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 2 , 3 }
( 3 , 3 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 3 , 2 }
( 3 , 3 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 3 , 2 }
( 3 , 3 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 3 , 2 }
( 3 , 3 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 2 , 2 }
( 3 , 2 }
( 4 , 2 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 3 , 1 }
( 3 , 2 }
( 3 , 3 }
( 3 , 4 }
( 3 , 5 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 3 , 1 }
( 3 , 2 }
( 3 , 3 }
( 3 , 4 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 3 , 1 }
( 3 , 2 }
( 3 , 3 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 3 , 1 }
( 3 , 2 }
( 4 , 2 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
report coordinate
( 1 , 1 }
( 2 , 1 }
( 3 , 1 }
( 4 , 1 }
( 4 , 2 }
( 4 , 3 }
( 4 , 4 }
( 4 , 5 }
35

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值