紫书上的题,P194页,这道题最精华的部分书上已经写好了,重点运用回溯法,这里不再多说,提交代码时注意格式;
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <stack>
using namespace std;
int A[20],vis[20],n;
int dec(int n){
if(n<2) return false;
else{
for(int i=2;i*i<=n;i++){
if(n%i==0) return false;
}
return true;
}
}
void dfs(int cur)
{
if(cur==n&&dec(A[0]+A[n-1])){
for(int i=0;i<n;i++){
if(i<n-1){ cout<<A[i]<<" "; }
else { cout<<A[i]<<endl;}
}
}
else{
for(int i=2;i<=n;i++){
if(!vis[i]&&dec(i+A[cur-1])){
A[cur]=i;
vis[i]=1;
dfs(cur+1);
vis[i]=0;
}
}
}
}
int main()
{
int p=0;
while(cin>>n&&n>0&&n<=16){
memset(vis,0,sizeof(vis));
A[0]=1;
if(p!=0) cout<<endl;p++;
cout<<"Case "<<p<<":"<<endl;
dfs(1);
}
return 0;
}