有什么问题评论问,必回!!!!
代码如下:
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <climits>
#include <cmath>
#define max 16*16+5
using namespace std;
int isp[max],vis[max],A[max];
int n,rows=0;
int is_prime(int num){ //判断素数
int k=1;
if(num==1||num==0) k=0;
for(int i=2;i*i<=num;i++)
if(!(num%i)){
k=0;break;
}
if(k) return 1;
return 0;
}
void print_f(int cur){ //回溯法
if(cur==n&&is_prime(A[0]+A[n-1])){
for(int i=0;i<n;i++){
if(i!=n-1)
printf("%d ",A[i]);
else
printf("%d",A[i]);
}
printf("\n");
}
else for(int i=2;i<=n;i++){
if(!vis[i]&&is_prime(i+A[cur-1])){
A[cur]=i;
vis[i]=1;
print_f(cur+1);
vis[i]=0;
}
}
}
int main(){
#ifdef DID
freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
#endif
while(scanf("%d",&n)!=EOF){
if(rows) printf("\n");
memset(isp,0,sizeof(isp));
memset(vis,0,sizeof(vis));
memset(A,0,sizeof(A));
A[0]=1;
for(int i=2;i<=n*n;i++) //生成素数表
isp[i]=is_prime(i);
printf("Case %d:\n",++rows);
print_f(1);
}
return 0;
}