#include<stdio.h>
#include<cmath>
#include<string.h>
#include<iostream>
using namespace std;
const int maxn = 32 + 5;
int isp[maxn] = {0};
int A[maxn] = {0};
int vis[maxn + 1] = {0};
int n;
//素数筛选(32以内的素数)
void is_prime()
{
int visit[maxn+1] = {0};
int m = sqrt(maxn + 0.5);
for(int i = 2;i <= m;i++)if(!visit[i])
for(int j = i * i;j <= maxn;j += i)
visit[j] = 1;
for(int i = 2;i < maxn;i++)if(!visit[i])isp[i] = 1;
}
void dfs(int cur)
{
if(cur == n && isp[A[0]] + A[n - 1]){//递归边界,别忘了测试第一个和最后一个数
for(int i = 0;i < n;i++)printf("%d ",A[i]);
printf("\n");
}
else for(int i = 2;i <= n;i++){//尝试放置每个数字i
if(!vis[i] && isp[i + A[cur - 1]]){//如果没用过i并且和前一个数字的和是素数的话
A[cur] = i;
vis[i] = 1;//设置使用标志
dfs(cur + 1);
vis[i] = 0; //回溯,清除标志
}
}
}
int main()
{
cout<<"test the prime in 32"<<endl;
memset(vis,0,sizeof(vis));
is_prime();
for(int i = 0;i < maxn;i++)if(isp[i])printf("%d ",i);
printf("\n");
printf("cin n\n");
cin>>n;
A[0] = 1;
dfs(1);
return 0;
}