UVA291_The House Of Santa Claus(DFS)

The House Of Santa Claus

In your childhood you most likely had to solve the riddle of the house of Santa Claus. Do you remember that the importance was on drawing the house in a stretch without lifting the pencil and not drawing a line twice? As a reminder it has to look like shown in Figure 1.

  
Figure: The House of Santa Claus

Well, a couple of years later, like now, you have to ``draw'' the house again but on the computer. As one possibility is not enough, we require all the possibilities when starting in the lower left corner. Follow the example in Figure 2 while defining your stretch.

  
Figure: This Sequence would give the Outputline 153125432

All the possibilities have to be listed in the outputfile by increasing order, meaning that 1234... is listed before 1235... .

Output

So, an outputfile could look like this:

12435123
13245123
...
15123421

解题报告

计算从节点1出发的所有可能访问序列，要求按节点递增序列输出

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>

using namespace std;
int mmap[6][6];
int vis[6][6];
void dfs(int x,int cnt,string str)
{
    str+=char(x+'0');
    if(cnt==8)
    {
            cout<<str;
        cout<<endl;
        return;
    }
    for(int i=1;i<=5;i++)
    {
        if(mmap[x][i]&&!vis[x][i])
        {
            vis[x][i]=vis[i][x]=1;
            dfs(i,cnt+1,str);
            vis[x][i]=vis[i][x]=0;
        }
    }
}
int main()
{
    for(int i=1;i<=5;i++)
    {
        for(int j=1;j<=5;j++)
            mmap[i][j]=1;
        mmap[i][i]=0;
    }
    mmap[1][4]=mmap[4][1]=mmap[2][4]=mmap[4][2]=0;
    dfs(1,0,"");
    return 0;
}