题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1016
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int vis[21],mp[21],n,sum;
int ssc[38]={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};///用一个数组保存1-40是否素数
void dfs(int x)
{
if(x>=n&&ssc[mp[0]+mp[n-1]])///如果到达n个,判断最后的一个和第一个和也为素数,如果是就输出这个素数环
{
for(int i=0;i<n-1;i++)
printf("%d ",mp[i]);
printf("%d\n",mp[n-1]);
}
for(int i=2;i<=n;i++)
if(vis[i]==0&&ssc[i+mp[x-1]])///遍历判断是否可以放入
{
mp[x]=i; ///放入该数
vis[i]=1; ///标记放入的数
dfs(x+1);
vis[i]=0;
}
}
int main()
{
sum=1;
while(scanf("%d",&n)!=EOF)
{
memset(vis,0,sizeof(vis));
memset(mp,0,sizeof(mp));
mp[0]=1; ///第一个为一定为1
printf("Case %d:\n",sum);
dfs(1);
printf("\n");
sum++;
}
return 0;
}