【CodeVS1031】质数环

#include<iostream>
using namespace std;
int vis[18]={0};
int a[18]={0};
int ans = 1,n;
int prime[40]={0};
int judgeprime(int x)
{
    if (x == 1) return 0;
    else if (x == 2) return 1;
    else for (int i=2;i<=x-1;i++)
    {
        if (x%i == 0) return 0;
    }
    return 1;
    
}
void print()
{
    for (int i=1;i<=n;i++) cout<<a[i]<<" ";
    cout<<endl;
}
void search(int x,int cnt)
{
    if (cnt == n && prime[x+1]) print();
    for (int i=1;i<=n;i++)
    {
        if (prime[x+i] && !vis[i])
        {
            vis[i]=1;
            a[cnt+1]=i;
            search(i,cnt+1);
            vis[i]=0;
        }
    }
}
int main()
{
    for (int i=1;i<=40;i++) prime[i] = judgeprime(i);
    cin>>n;
    vis[1]=1;
    a[1]=1;
    search(1,1);
    return 0;
}