-
Notifications
You must be signed in to change notification settings - Fork 10
/
PCIRCLE.cpp
71 lines (59 loc) 路 1.32 KB
/
PCIRCLE.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef unsigned long long ull;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define ep emplace_back
#define EL printf("\n")
#define sz(A) (int) A.size()
#define FOR(i,l,r) for (int i=l;i<=r;i++)
#define FOD(i,r,l) for (int i=r;i>=l;i--)
#define fillchar(a,x) memset(a, x, sizeof (a))
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n,x[100],dd[100];
bool yes[100][100];
int res[100] = {0, 0, 2, 2, 4, 96, 1024, 2880, 81024, 770144};
int dem = 0;
bool kt(int x) {
if (x <= 1) return false;
for (int i=2; i*i<=x; i++)
if (x % i == 0) return false;
return true;
}
void dq(int t) {
if (t == n+1) {
if (not yes[x[1]][x[n]]) return;
dem++;
for (int i=1; i<=n; i++) printf("%d ",x[i]);
printf("\n");
return;
}
for (int i=1; i<=n; i++)
if (dd[i] == 0 and yes[x[t-1]][i]) {
x[t] = i;
dd[i] = 1;
dq(t+1);
if (dem == 10000) return;
dd[i] = 0;
}
}
int main() {
// freopen("INP.TXT", "r", stdin);
// freopen("OUT.TXT", "w", stdout);
scanf("%d",&n);
printf("%d\n",res[n]);
n *= 2;
for (int i=1; i<=n; i++)
for (int j=i; j<=n; j++) {
yes[i][j] = kt(i+j);
yes[j][i] = yes[i][j];
}
x[1] = 1;
dd[1] = 1;
dq(2);
return 0;
}