nyoj488素数环——DFS

怎样都WA 心态炸了

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <math.h>
#include <string.h>
using namespace std;
int ncase = 0;
int a[20];
int N;
int book[20];
int flag;
int prime[20] = {0,0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1};
void dfs(int cur){
    if(cur == N+1){
        if(prime[a[1]+a[N]]){
            for(int i=1;i<N;i++)
                printf("%d ",a[i]);
            printf("%d\n",a[N]);
            flag = 1;
            }
        return ;
    }
    for(int i=2;i<=N;i++){
        if(book[i] == 0 && prime[a[cur-1]+i]){
            a[cur] = i;
            book[i] = 1;
            dfs(cur+1);
            book[i] = 0;
        }
    }
}
int main(){
    while(scanf("%d",&N) && N){
        flag = 0;
        if(flag == 0){
            memset(book,0,sizeof(book));
            memset(a,0,sizeof(a));
            a[1] = 1;
            printf("Case %d:\n",++ncase);
            dfs(2);
            if(flag==0)
                printf("No Answer\n");
        }
    }
    return 0;
}

正确代码

#include <stdio.h>
#include <string.h>
int n,ac[21]={1};
bool in[21];
bool is_prime(int x)
{
for(int i=2;i*i<=x;i++)
if(x%i==0)
return false;
return true;
}
void dfs(int cur)
{
if(cur == n-1)
{
if(is_prime(ac[cur]+1))
{
printf("1");
for(int i=1;i<n;i++)
printf(" %d",ac[i]);
printf("\n");
}
return ;
}
for(int i=2;i<=n;i++)
{
if(!in[i] && is_prime(i+ac[cur]))
{
in[i]=1;
ac[cur+1]=i;
dfs(cur+1);
in[i]=0;
}
}
}
int main()
{
int ncase=0;
while(scanf("%d",&n),n)
{
printf("Case %d:\n",++ncase);
memset(in,0,sizeof(in));
if(n%2==0 || n==1)
dfs(0);
else
printf("No Answer\n");
}
return 0;
}