oj.uz

답안 #7525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
7525 2014-08-10T12:12:36 Z tncks0121 경비원 (GA8_guard) C++
8 / 100
 2000 ms 1128 KB 
	
#include <cstdio>
using namespace std;
  
int gcd (int a, int b) { return b == 0 ? a : gcd(b, a%b); }
int n, a[100], g[100][100], x[100];
  
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]);
        }
    }
  
  
        int res = 0;
    for(int state = 0; state < (1<<n); state++) {
        int c = 0;
        for(int i = 0; i < n; i++) if((state >> i) & 1) x[c++] = i;
        if(c <= 1) continue;
        bool s = true;
        for(int i = 0; i < c && s; i++) {
            for(int j = i+1; j < c && s; j++) {
                if(g[x[i]][x[j]] >= 2) s = false;
            }
        }
        if(s) {
            ++res;
        //for(int i = 0; i < c; i++) printf("%s%d%s", (i == 0) ? "{" : "", a[x[i]], ((i == c-1) ? "}\n": ", "));
        }
    }
  
    printf("%d\n", res);
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1128 KB Output is correct
2 Correct 0 ms 1128 KB Output is correct
3 Correct 0 ms 1128 KB Output is correct
4 Correct 0 ms 1128 KB Output is correct
5 Correct 0 ms 1128 KB Output is correct
6 Correct 0 ms 1128 KB Output is correct
7 Correct 0 ms 1128 KB Output is correct
8 Correct 0 ms 1128 KB Output is correct
9 Correct 4 ms 1128 KB Output is correct
10 Correct 4 ms 1128 KB Output is correct
11 Correct 96 ms 1128 KB Output is correct
12 Correct 88 ms 1128 KB Output is correct
13 Correct 0 ms 1128 KB Output is correct
14 Correct 0 ms 1128 KB Output is correct
15 Correct 0 ms 1128 KB Output is correct
16 Correct 0 ms 1128 KB Output is correct
17 Correct 0 ms 1128 KB Output is correct
18 Correct 0 ms 1128 KB Output is correct
19 Correct 0 ms 1128 KB Output is correct
20 Correct 0 ms 1128 KB Output is correct
21 Correct 0 ms 1128 KB Output is correct
22 Correct 0 ms 1128 KB Output is correct
23 Correct 0 ms 1128 KB Output is correct
24 Correct 0 ms 1128 KB Output is correct
25 Correct 4 ms 1128 KB Output is correct
26 Correct 4 ms 1128 KB Output is correct
27 Correct 8 ms 1128 KB Output is correct
28 Correct 96 ms 1128 KB Output is correct
29 Correct 112 ms 1128 KB Output is correct
30 Correct 220 ms 1128 KB Output is correct
31 Correct 0 ms 1128 KB Output is correct
32 Correct 0 ms 1128 KB Output is correct
33 Correct 0 ms 1128 KB Output is correct
34 Correct 0 ms 1128 KB Output is correct
35 Correct 4 ms 1128 KB Output is correct
36 Correct 96 ms 1128 KB Output is correct
37 Correct 0 ms 1128 KB Output is correct
38 Correct 0 ms 1128 KB Output is correct
39 Correct 0 ms 1128 KB Output is correct
40 Correct 0 ms 1128 KB Output is correct
41 Correct 8 ms 1128 KB Output is correct
42 Correct 184 ms 1128 KB Output is correct

Subtask #2
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1128 KB Output is correct
2 Correct 0 ms 1128 KB Output is correct
3 Correct 0 ms 1128 KB Output is correct
4 Correct 0 ms 1128 KB Output is correct
5 Correct 0 ms 1128 KB Output is correct
6 Correct 0 ms 1128 KB Output is correct
7 Correct 0 ms 1128 KB Output is correct
8 Correct 0 ms 1128 KB Output is correct
9 Correct 0 ms 1128 KB Output is correct
10 Correct 0 ms 1128 KB Output is correct
11 Correct 0 ms 1128 KB Output is correct
12 Correct 0 ms 1128 KB Output is correct
13 Correct 0 ms 1128 KB Output is correct
14 Correct 0 ms 1128 KB Output is correct
15 Correct 4 ms 1128 KB Output is correct
16 Correct 12 ms 1128 KB Output is correct
17 Correct 20 ms 1128 KB Output is correct
18 Correct 52 ms 1128 KB Output is correct
19 Correct 108 ms 1128 KB Output is correct
20 Correct 220 ms 1128 KB Output is correct
21 Correct 456 ms 1128 KB Output is correct
22 Correct 932 ms 1128 KB Output is correct
23 Correct 1912 ms 1128 KB Output is correct
24 Execution timed out 2000 ms 1124 KB Program timed out
25 Halted 0 ms 0 KB -

Subtask #3
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 1128 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 1124 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 1124 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -