#include <cstdio>
using namespace std;
int gcd (int a, int b) { return b == 0 ? a : gcd(b, a%b); }
int n, a[2225], g[2225][2225], w[2225], c;
bool used[2225];
int res;
void solve (int x) {
if(x == n) { ++res; return; }
solve(x+1);
for(int i = 0; i < c; i++) {
if(g[x][w[i]] > 1) return;
}
w[c++] = x;
solve(x+1);
w[--c] = 0;
}
int main() {
scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%d", a+i);
for(int i = 0; i < n; i++) {
for(int j = i+1; j < n; j++) {
g[i][j] = g[j][i] = gcd(a[i], a[j]);
}
}
solve(0);
res -= n+1;
printf("%d\n", res);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
20444 KB |
Output is correct |
2 |
Correct |
0 ms |
20444 KB |
Output is correct |
3 |
Correct |
0 ms |
20444 KB |
Output is correct |
4 |
Correct |
0 ms |
20444 KB |
Output is correct |
5 |
Correct |
0 ms |
20444 KB |
Output is correct |
6 |
Correct |
0 ms |
20444 KB |
Output is correct |
7 |
Correct |
0 ms |
20444 KB |
Output is correct |
8 |
Correct |
0 ms |
20444 KB |
Output is correct |
9 |
Correct |
0 ms |
20444 KB |
Output is correct |
10 |
Correct |
0 ms |
20444 KB |
Output is correct |
11 |
Correct |
0 ms |
20444 KB |
Output is correct |
12 |
Correct |
0 ms |
20444 KB |
Output is correct |
13 |
Correct |
0 ms |
20444 KB |
Output is correct |
14 |
Correct |
0 ms |
20444 KB |
Output is correct |
15 |
Correct |
0 ms |
20444 KB |
Output is correct |
16 |
Correct |
0 ms |
20444 KB |
Output is correct |
17 |
Correct |
0 ms |
20444 KB |
Output is correct |
18 |
Correct |
0 ms |
20444 KB |
Output is correct |
19 |
Correct |
0 ms |
20444 KB |
Output is correct |
20 |
Correct |
0 ms |
20444 KB |
Output is correct |
21 |
Correct |
0 ms |
20444 KB |
Output is correct |
22 |
Correct |
0 ms |
20444 KB |
Output is correct |
23 |
Correct |
0 ms |
20444 KB |
Output is correct |
24 |
Correct |
0 ms |
20444 KB |
Output is correct |
25 |
Correct |
0 ms |
20444 KB |
Output is correct |
26 |
Correct |
0 ms |
20444 KB |
Output is correct |
27 |
Correct |
0 ms |
20444 KB |
Output is correct |
28 |
Correct |
0 ms |
20444 KB |
Output is correct |
29 |
Correct |
0 ms |
20444 KB |
Output is correct |
30 |
Correct |
24 ms |
20444 KB |
Output is correct |
31 |
Correct |
0 ms |
20444 KB |
Output is correct |
32 |
Correct |
0 ms |
20444 KB |
Output is correct |
33 |
Correct |
0 ms |
20444 KB |
Output is correct |
34 |
Correct |
0 ms |
20444 KB |
Output is correct |
35 |
Correct |
0 ms |
20444 KB |
Output is correct |
36 |
Correct |
0 ms |
20444 KB |
Output is correct |
37 |
Correct |
0 ms |
20444 KB |
Output is correct |
38 |
Correct |
0 ms |
20444 KB |
Output is correct |
39 |
Correct |
0 ms |
20444 KB |
Output is correct |
40 |
Correct |
0 ms |
20444 KB |
Output is correct |
41 |
Correct |
0 ms |
20444 KB |
Output is correct |
42 |
Correct |
0 ms |
20444 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
20444 KB |
Output is correct |
2 |
Correct |
0 ms |
20444 KB |
Output is correct |
3 |
Correct |
0 ms |
20444 KB |
Output is correct |
4 |
Correct |
0 ms |
20444 KB |
Output is correct |
5 |
Correct |
0 ms |
20444 KB |
Output is correct |
6 |
Correct |
0 ms |
20444 KB |
Output is correct |
7 |
Correct |
0 ms |
20444 KB |
Output is correct |
8 |
Correct |
0 ms |
20444 KB |
Output is correct |
9 |
Correct |
0 ms |
20444 KB |
Output is correct |
10 |
Correct |
0 ms |
20444 KB |
Output is correct |
11 |
Correct |
0 ms |
20444 KB |
Output is correct |
12 |
Correct |
0 ms |
20444 KB |
Output is correct |
13 |
Correct |
0 ms |
20444 KB |
Output is correct |
14 |
Correct |
0 ms |
20444 KB |
Output is correct |
15 |
Correct |
0 ms |
20444 KB |
Output is correct |
16 |
Correct |
0 ms |
20444 KB |
Output is correct |
17 |
Correct |
0 ms |
20444 KB |
Output is correct |
18 |
Correct |
0 ms |
20444 KB |
Output is correct |
19 |
Correct |
0 ms |
20444 KB |
Output is correct |
20 |
Correct |
0 ms |
20444 KB |
Output is correct |
21 |
Correct |
0 ms |
20444 KB |
Output is correct |
22 |
Correct |
0 ms |
20444 KB |
Output is correct |
23 |
Correct |
0 ms |
20444 KB |
Output is correct |
24 |
Correct |
0 ms |
20444 KB |
Output is correct |
25 |
Correct |
0 ms |
20444 KB |
Output is correct |
26 |
Correct |
0 ms |
20444 KB |
Output is correct |
27 |
Correct |
0 ms |
20444 KB |
Output is correct |
28 |
Correct |
0 ms |
20444 KB |
Output is correct |
29 |
Correct |
0 ms |
20444 KB |
Output is correct |
30 |
Correct |
0 ms |
20444 KB |
Output is correct |
31 |
Correct |
0 ms |
20444 KB |
Output is correct |
32 |
Correct |
0 ms |
20444 KB |
Output is correct |
33 |
Correct |
4 ms |
20444 KB |
Output is correct |
34 |
Correct |
4 ms |
20444 KB |
Output is correct |
35 |
Correct |
4 ms |
20444 KB |
Output is correct |
36 |
Correct |
8 ms |
20444 KB |
Output is correct |
37 |
Correct |
8 ms |
20444 KB |
Output is correct |
38 |
Correct |
12 ms |
20444 KB |
Output is correct |
39 |
Correct |
12 ms |
20444 KB |
Output is correct |
40 |
Correct |
20 ms |
20444 KB |
Output is correct |
41 |
Correct |
24 ms |
20444 KB |
Output is correct |
42 |
Correct |
32 ms |
20444 KB |
Output is correct |
43 |
Correct |
36 ms |
20444 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2000 ms |
20440 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2000 ms |
20440 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2000 ms |
20440 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |