oj.uz

Submission #2855

# Submission time Handle Problem Language Result Execution time Memory
2855 2013-07-31T23:15:27 Z naver1 속이기 (GA5_fake) C++
0 / 100
 20 ms 5000 KB 
#include <stdio.h>

using namespace std;

int a[1001][1001];
int main()
{
    int i,j;
    int num;
    int b[1001];
    scanf("%d",&num);
    for(i=0;i<num;i++) {
        scanf("%d",&b[i]);
    }
    int max=0;
    for(i=0;i<num;i++) {
        for(j=0;;j++) {
            if(b[i]%2==0) a[i][j]=0;
            else a[i][j]=1;
            if(b[i]==1) {
                if(j>max) max=j;
                break;
            }
            b[i]=b[i]/2;
        }
    }
    int ak[1001]={0,};
    for(i=0;i<num;i++) {
        for(j=0;j<num;j++) {
            if(a[j][i]==1) ak[i]++;
        }
    }
    int ck=1;
    for(i=0;i<num;i++) {
        if(ak[i]%2==1) {
            ck=0;
            break;
        }
    }
    if(ck==1) printf("0");
    else printf("0");
    return 0;
}

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5000 KB Output is correct
2 Incorrect 0 ms 5000 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5000 KB Output is correct
2 Incorrect 0 ms 5000 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 5000 KB Output isn't correct
2 Halted 0 ms 0 KB -