HDOJ1016 Prime Ring Problem(DFS第二層理解)
Note: the number of first circle should always be 1.
You are to write a program that completes above process.
Print a blank line after each case.
1 4 3 2 5 6
1 6 5 2 3 4
Case 2:
1 2 3 8 5 6 7 4
1 2 5 8 3 4 7 6
1 4 7 6 5 8 3 2
1 6 7 4 3 8 5 2
#include<string.h>
using namespace std;
int prime[40]={0,1,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0},n;//素數打表,因爲n最大是20,所以只要打到40
int visited[21],a[21];
void dfs(int num)//深搜
{
int i;
if(num==n&&prime[a[num-1]+a[0]]) //滿足條件了,就輸出來
{
for(i=0;i<num-1;i++)
printf("%d ",a[i]);
printf("%d\n",a[num-1]);
}
else
{
for(i=2;i<=n;i++)
{
if(visited[i]==0)//是否用過了
{
if(prime[i+a[num-1]]) //是否和相鄰的加起來是素數
{
visited[i]=-1;//標記了
a[num++]=i;//放進數組
dfs(num); //遞歸調用
visited[i]=0; //退去標記
num--;
}
}
}
}
}
int main()
{
int num=0;
while(cin>>n)
{
num++;
printf("Case %d:\n",num);
memset(visited,0,sizeof(visited));
a[0]=1;
dfs(1);
printf("\n");
}
return 0;
}