【Codevs1080】质数环

http://codevs.cn/problem/1031/

不讲什么,预处理素数+搜索

// <C.cpp> - Sun Oct  9 12:58:23 2016
// This file is made by YJinpeng，created by XuYike's black technology automatically.
// Copyright (C) 2016 ChangJun High School, Inc.
// I don't know what this program is.

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#define MOD 1000000007
#define INF 1e9
using namespace std;
typedef long long LL;
const int MAXN=;
inline int gi() {
    register int w=,q=;register char ch=getchar();
    while((ch<''||ch>'')&&ch!='-')ch=getchar();
    if(ch=='-')q=,ch=getchar();
    while(ch>=''&&ch<='')w=w*+ch-'',ch=getchar();
    return q?-w:w;
}
bool f[MAXN],u[MAXN];int a[MAXN],n;
void dfs(int d){
    if(n==d){
        if(f[a[d-]+]){
            for(int i=;i<n;i++)printf("%d ",a[i]);
            printf("\n");
        }return;
    }
    for(int i=;i<=n;i++)
        if(!u[i]&&f[i+a[d-]]){
            u[i]=;a[d]=i;
            dfs(d+);u[i]=;
        }
}
int main()
{
    freopen("1031.in","r",stdin);
    freopen("1031.out","w",stdout);
    n=gi();
    u[]=(bool)(a[]=);
    for(int i=;f[i]=,i<MAXN;i++)
        for(int j=,to=sqrt(i);j<=to;j++)
            if(i%j==){f[i]=;break;}
    dfs();
    return ;
}