Submission #2913

# Submission time Handle Problem Language Result Execution time Memory
2913 2013-08-03T11:17:44 Z alephnull 속이기 (GA5_fake) C++
100 / 100
0 ms 1096 KB
#include <cstdio>
#include <algorithm>
using namespace std;
int p[2000];
int main() {
	int n;
	scanf("%d", &n);
	int x=0;int sum=0;
	for (int i = 0; i < n; i++) {
		scanf("%d",p+i);
		x^=p[i];
	}
	sort(p,p+n);
	for(int i=1;i<n;i++){
		sum+=p[i];
	}
	if(x==0)
		printf("%d",sum);
	else puts("0");
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1096 KB Output is correct
2 Correct 0 ms 1096 KB Output is correct
3 Correct 0 ms 1096 KB Output is correct
4 Correct 0 ms 1096 KB Output is correct
5 Correct 0 ms 1096 KB Output is correct
6 Correct 0 ms 1096 KB Output is correct
7 Correct 0 ms 1096 KB Output is correct
8 Correct 0 ms 1096 KB Output is correct
9 Correct 0 ms 1096 KB Output is correct
10 Correct 0 ms 1096 KB Output is correct
11 Correct 0 ms 1096 KB Output is correct
12 Correct 0 ms 1096 KB Output is correct
13 Correct 0 ms 1096 KB Output is correct
14 Correct 0 ms 1096 KB Output is correct
15 Correct 0 ms 1096 KB Output is correct
16 Correct 0 ms 1096 KB Output is correct
17 Correct 0 ms 1096 KB Output is correct
18 Correct 0 ms 1096 KB Output is correct
19 Correct 0 ms 1096 KB Output is correct
20 Correct 0 ms 1096 KB Output is correct
21 Correct 0 ms 1096 KB Output is correct
22 Correct 0 ms 1096 KB Output is correct
23 Correct 0 ms 1096 KB Output is correct
24 Correct 0 ms 1096 KB Output is correct
25 Correct 0 ms 1096 KB Output is correct
26 Correct 0 ms 1096 KB Output is correct
27 Correct 0 ms 1096 KB Output is correct
28 Correct 0 ms 1096 KB Output is correct
29 Correct 0 ms 1096 KB Output is correct
30 Correct 0 ms 1096 KB Output is correct
31 Correct 0 ms 1096 KB Output is correct
32 Correct 0 ms 1096 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1096 KB Output is correct
2 Correct 0 ms 1096 KB Output is correct
3 Correct 0 ms 1096 KB Output is correct
4 Correct 0 ms 1096 KB Output is correct
5 Correct 0 ms 1096 KB Output is correct
6 Correct 0 ms 1096 KB Output is correct
7 Correct 0 ms 1096 KB Output is correct
8 Correct 0 ms 1096 KB Output is correct
9 Correct 0 ms 1096 KB Output is correct
10 Correct 0 ms 1096 KB Output is correct
11 Correct 0 ms 1096 KB Output is correct
12 Correct 0 ms 1096 KB Output is correct
13 Correct 0 ms 1096 KB Output is correct
14 Correct 0 ms 1096 KB Output is correct
15 Correct 0 ms 1096 KB Output is correct
16 Correct 0 ms 1096 KB Output is correct
17 Correct 0 ms 1096 KB Output is correct
18 Correct 0 ms 1096 KB Output is correct
19 Correct 0 ms 1096 KB Output is correct
20 Correct 0 ms 1096 KB Output is correct
21 Correct 0 ms 1096 KB Output is correct
22 Correct 0 ms 1096 KB Output is correct
23 Correct 0 ms 1096 KB Output is correct
24 Correct 0 ms 1096 KB Output is correct
25 Correct 0 ms 1096 KB Output is correct
26 Correct 0 ms 1096 KB Output is correct
27 Correct 0 ms 1096 KB Output is correct
28 Correct 0 ms 1096 KB Output is correct
29 Correct 0 ms 1096 KB Output is correct
30 Correct 0 ms 1096 KB Output is correct
31 Correct 0 ms 1096 KB Output is correct
32 Correct 0 ms 1096 KB Output is correct
33 Correct 0 ms 1096 KB Output is correct
34 Correct 0 ms 1096 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1096 KB Output is correct
2 Correct 0 ms 1096 KB Output is correct
3 Correct 0 ms 1096 KB Output is correct
4 Correct 0 ms 1096 KB Output is correct
5 Correct 0 ms 1096 KB Output is correct
6 Correct 0 ms 1096 KB Output is correct
7 Correct 0 ms 1096 KB Output is correct
8 Correct 0 ms 1096 KB Output is correct
9 Correct 0 ms 1096 KB Output is correct
10 Correct 0 ms 1096 KB Output is correct
11 Correct 0 ms 1096 KB Output is correct
12 Correct 0 ms 1096 KB Output is correct
13 Correct 0 ms 1096 KB Output is correct
14 Correct 0 ms 1096 KB Output is correct
15 Correct 0 ms 1096 KB Output is correct
16 Correct 0 ms 1096 KB Output is correct
17 Correct 0 ms 1096 KB Output is correct
18 Correct 0 ms 1096 KB Output is correct
19 Correct 0 ms 1096 KB Output is correct
20 Correct 0 ms 1096 KB Output is correct
21 Correct 0 ms 1096 KB Output is correct
22 Correct 0 ms 1096 KB Output is correct
23 Correct 0 ms 1096 KB Output is correct
24 Correct 0 ms 1096 KB Output is correct
25 Correct 0 ms 1096 KB Output is correct
26 Correct 0 ms 1096 KB Output is correct
27 Correct 0 ms 1096 KB Output is correct
28 Correct 0 ms 1096 KB Output is correct
29 Correct 0 ms 1096 KB Output is correct
30 Correct 0 ms 1096 KB Output is correct
31 Correct 0 ms 1096 KB Output is correct
32 Correct 0 ms 1096 KB Output is correct
33 Correct 0 ms 1096 KB Output is correct
34 Correct 0 ms 1096 KB Output is correct
35 Correct 0 ms 1096 KB Output is correct
36 Correct 0 ms 1096 KB Output is correct
37 Correct 0 ms 1096 KB Output is correct
38 Correct 0 ms 1096 KB Output is correct
39 Correct 0 ms 1096 KB Output is correct
40 Correct 0 ms 1096 KB Output is correct
41 Correct 0 ms 1096 KB Output is correct
42 Correct 0 ms 1096 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1096 KB Output is correct
2 Correct 0 ms 1096 KB Output is correct
3 Correct 0 ms 1096 KB Output is correct
4 Correct 0 ms 1096 KB Output is correct
5 Correct 0 ms 1096 KB Output is correct
6 Correct 0 ms 1096 KB Output is correct
7 Correct 0 ms 1096 KB Output is correct
8 Correct 0 ms 1096 KB Output is correct
9 Correct 0 ms 1096 KB Output is correct
10 Correct 0 ms 1096 KB Output is correct