同样是dfs。判断相邻是否是素数,用dfs
因为数据不大,可以直接将40以内的素数直接写出来,判断的时候就方便很多。
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cctype>
using namespace std;
int a[21],n,pre;
int b[21],c[21];
int f[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};
void print()
{
for(int i=1;i<n;i++)
cout<<b[i]<<" ";
cout<<b[n]<<endl;
}
void dfs(int dep)
{
if(dep == n+1)
{
if(f[1+b[dep-1]])
print();
return ;
}
for(int i=2;i<=n;i++)
{
if(f[i+b[dep-1]]&&!c[i])
{
b[dep]=i;
c[i]=1;
dfs(dep+1);
c[i]=0;
}
}
return ;
}
int main()
{
int count=1;
while(cin>>n)
{
memset(b,0,sizeof(b));
memset(a,0,sizeof(a));
memset(c,0,sizeof(c));
for(int i=1;i<=n;i++)
a[i]=i;
cout<<"Case "<<count++<<":"<<endl;
b[1]=1;
dfs(2);
cout<<endl;
}
}