oj.uz

Submission #2899

# Submission time Handle Problem Language Result Execution time Memory
2899 2013-08-01T13:32:01 Z zyslee 속이기 (GA5_fake) C++
60 / 100
 0 ms 1092 KB 
#include<stdio.h>
int data[1001], play[11];
int main()
{
	int n, i, k, kk, sum=0, min=0;
	scanf("%d", &n);
	for(i=1;i<=n;i++){
		scanf("%d", &data[i]);
		sum+=data[i];
		if(min==0 || min>data[i]) min = data[i];
		k = 0;
		kk = data[i];
		while(kk>0){
			play[++k] = (play[k]+(kk%2))%2;
			kk/=2;
		}
	}
	for(i=1;i<=n;i++){
		if(play[i]==1){
			printf("%d", 0);
			return 0;
		}
	}
	printf("%d", sum-min);
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1092 KB Output is correct
2 Correct 0 ms 1092 KB Output is correct
3 Correct 0 ms 1092 KB Output is correct
4 Correct 0 ms 1092 KB Output is correct
5 Correct 0 ms 1092 KB Output is correct
6 Correct 0 ms 1092 KB Output is correct
7 Correct 0 ms 1092 KB Output is correct
8 Correct 0 ms 1092 KB Output is correct
9 Correct 0 ms 1092 KB Output is correct
10 Correct 0 ms 1092 KB Output is correct
11 Correct 0 ms 1092 KB Output is correct
12 Correct 0 ms 1092 KB Output is correct
13 Correct 0 ms 1092 KB Output is correct
14 Correct 0 ms 1092 KB Output is correct
15 Correct 0 ms 1092 KB Output is correct
16 Correct 0 ms 1092 KB Output is correct
17 Correct 0 ms 1092 KB Output is correct
18 Correct 0 ms 1092 KB Output is correct
19 Correct 0 ms 1092 KB Output is correct
20 Correct 0 ms 1092 KB Output is correct
21 Correct 0 ms 1092 KB Output is correct
22 Correct 0 ms 1092 KB Output is correct
23 Correct 0 ms 1092 KB Output is correct
24 Correct 0 ms 1092 KB Output is correct
25 Correct 0 ms 1092 KB Output is correct
26 Correct 0 ms 1092 KB Output is correct
27 Correct 0 ms 1092 KB Output is correct
28 Correct 0 ms 1092 KB Output is correct
29 Correct 0 ms 1092 KB Output is correct
30 Correct 0 ms 1092 KB Output is correct
31 Correct 0 ms 1092 KB Output is correct
32 Correct 0 ms 1092 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1092 KB Output is correct
2 Correct 0 ms 1092 KB Output is correct
3 Correct 0 ms 1092 KB Output is correct
4 Correct 0 ms 1092 KB Output is correct
5 Correct 0 ms 1092 KB Output is correct
6 Correct 0 ms 1092 KB Output is correct
7 Correct 0 ms 1092 KB Output is correct
8 Correct 0 ms 1092 KB Output is correct
9 Correct 0 ms 1092 KB Output is correct
10 Correct 0 ms 1092 KB Output is correct
11 Correct 0 ms 1092 KB Output is correct
12 Correct 0 ms 1092 KB Output is correct
13 Correct 0 ms 1092 KB Output is correct
14 Correct 0 ms 1092 KB Output is correct
15 Correct 0 ms 1092 KB Output is correct
16 Correct 0 ms 1092 KB Output is correct
17 Correct 0 ms 1092 KB Output is correct
18 Correct 0 ms 1092 KB Output is correct
19 Correct 0 ms 1092 KB Output is correct
20 Correct 0 ms 1092 KB Output is correct
21 Correct 0 ms 1092 KB Output is correct
22 Correct 0 ms 1092 KB Output is correct
23 Correct 0 ms 1092 KB Output is correct
24 Correct 0 ms 1092 KB Output is correct
25 Correct 0 ms 1092 KB Output is correct
26 Correct 0 ms 1092 KB Output is correct
27 Correct 0 ms 1092 KB Output is correct
28 Correct 0 ms 1092 KB Output is correct
29 Correct 0 ms 1092 KB Output is correct
30 Correct 0 ms 1092 KB Output is correct
31 Correct 0 ms 1092 KB Output is correct
32 Correct 0 ms 1092 KB Output is correct
33 Correct 0 ms 1092 KB Output is correct
34 Correct 0 ms 1092 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1092 KB Output is correct
2 Correct 0 ms 1092 KB Output is correct
3 Correct 0 ms 1092 KB Output is correct
4 Correct 0 ms 1092 KB Output is correct
5 Correct 0 ms 1092 KB Output is correct
6 Correct 0 ms 1092 KB Output is correct
7 Correct 0 ms 1092 KB Output is correct
8 Correct 0 ms 1092 KB Output is correct
9 Correct 0 ms 1092 KB Output is correct
10 Correct 0 ms 1092 KB Output is correct
11 Correct 0 ms 1092 KB Output is correct
12 Correct 0 ms 1092 KB Output is correct
13 Correct 0 ms 1092 KB Output is correct
14 Correct 0 ms 1092 KB Output is correct
15 Correct 0 ms 1092 KB Output is correct
16 Correct 0 ms 1092 KB Output is correct
17 Correct 0 ms 1092 KB Output is correct
18 Correct 0 ms 1092 KB Output is correct
19 Correct 0 ms 1092 KB Output is correct
20 Correct 0 ms 1092 KB Output is correct
21 Correct 0 ms 1092 KB Output is correct
22 Correct 0 ms 1092 KB Output is correct
23 Correct 0 ms 1092 KB Output is correct
24 Correct 0 ms 1092 KB Output is correct
25 Correct 0 ms 1092 KB Output is correct
26 Correct 0 ms 1092 KB Output is correct
27 Correct 0 ms 1092 KB Output is correct
28 Correct 0 ms 1092 KB Output is correct
29 Correct 0 ms 1092 KB Output is correct
30 Correct 0 ms 1092 KB Output is correct
31 Correct 0 ms 1092 KB Output is correct
32 Correct 0 ms 1092 KB Output is correct
33 Correct 0 ms 1092 KB Output is correct
34 Correct 0 ms 1092 KB Output is correct
35 Correct 0 ms 1092 KB Output is correct
36 Correct 0 ms 1092 KB Output is correct
37 Correct 0 ms 1092 KB Output is correct
38 Correct 0 ms 1092 KB Output is correct
39 Correct 0 ms 1092 KB Output is correct
40 Correct 0 ms 1092 KB Output is correct
41 Correct 0 ms 1092 KB Output is correct
42 Correct 0 ms 1092 KB Output is correct

Subtask #4
0.0 / 40.0

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