hdoj1016(简单DFS)

最新推荐文章于 2020-02-08 15:19:16 发布

呆呆侠

最新推荐文章于 2020-02-08 15:19:16 发布

阅读量753

点赞数

分类专栏： DFS

本文链接：https://blog.csdn.net/liuzhenghui666666/article/details/79399453

版权

DFS 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
int isprime[40]={0,0,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};
int vis[21];//用来记录是否被访问过 
int a[21];//用来记录位置顺序 
int n;
void dfs(int num)
{
	int i;
	if(num==n&&(isprime[a[n-1]+a[0]])){
		cout<<a[0];
		for(i=1;i<n;i++)
		{
			cout<<" "<<a[i]; 
		}
		cout<<endl;
	}else{
		for(i=2;i<=n;i++)
		{
			if(vis[i]==0&&isprime[i+a[num-1]])
			{
				vis[i]=1;
				a[num++]=i;
				dfs(num);
				vis[i]=0;
				num--;
			}
		}
	} 
}
int main()
{
	a[0]=1;
	int k=1;
	while(scanf("%d",&n)!=EOF)
	{
		cout<<"Case "<<k++<<":"<<endl;
		dfs(1);
		cout<<endl;
	}
	return 0;
}