oj.uz

Submission #2876

# Submission time Handle Problem Language Result Execution time Memory
2876 2013-08-01T08:39:01 Z pl0892029 속이기 (GA5_fake) C++
100 / 100
 0 ms 1092 KB 
#include <cstdio>
int bit[17];
int arr[1000];

int min(int a,int b) {
	return a<b ? a:b;
}

int main() {
	int n, sum=0;
	scanf("%d",&n);

	for(int i=0;i<n;i++) {
		scanf("%d",arr+i);
		sum += arr[i];
		for(int j=0;(1<<j)<=arr[i];j++)
			if( (arr[i]&(1<<j)) > 0 )
				bit[j]++;
	}

	for(int i=0;i<17;i++) {
		if( bit[i]%2 == 1 ) {
			puts("0");
			return 0;
		}
	}

	int minElement = 0x7fffffff;

	for(int i=0;i<n;i++)
		minElement = min(minElement,arr[i]);

	printf("%d",sum-minElement);
}

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
40.0 / 40.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