oj.uz

답안 #2868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
2868 2013-08-01T05:04:50 Z solveit 속이기 (GA5_fake) C++
100 / 100
 0 ms 1672 KB 
#include <iostream>
#include <string>
#include <math.h>
#include <sstream>
#include <cstdio>
#include <algorithm>

using namespace std;

int N;
int main() {
    int xorRes = 0, sum = 0, smallest = 1<<30;
    scanf("%d",&N);
    for(int i = 1;i<=N;i++) {
        int n;
        scanf("%d", &n);
        xorRes ^= n;
        sum +=  n;
        smallest = min(smallest, n);
    }
    if(xorRes == 0)
        printf("%d\n", sum - smallest);
    else
        printf("%d\n", 0);
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1672 KB Output is correct
2 Correct 0 ms 1672 KB Output is correct
3 Correct 0 ms 1672 KB Output is correct
4 Correct 0 ms 1672 KB Output is correct
5 Correct 0 ms 1672 KB Output is correct
6 Correct 0 ms 1672 KB Output is correct
7 Correct 0 ms 1672 KB Output is correct
8 Correct 0 ms 1672 KB Output is correct
9 Correct 0 ms 1672 KB Output is correct
10 Correct 0 ms 1672 KB Output is correct
11 Correct 0 ms 1672 KB Output is correct
12 Correct 0 ms 1672 KB Output is correct
13 Correct 0 ms 1672 KB Output is correct
14 Correct 0 ms 1672 KB Output is correct
15 Correct 0 ms 1672 KB Output is correct
16 Correct 0 ms 1672 KB Output is correct
17 Correct 0 ms 1672 KB Output is correct
18 Correct 0 ms 1672 KB Output is correct
19 Correct 0 ms 1672 KB Output is correct
20 Correct 0 ms 1672 KB Output is correct
21 Correct 0 ms 1672 KB Output is correct
22 Correct 0 ms 1672 KB Output is correct
23 Correct 0 ms 1672 KB Output is correct
24 Correct 0 ms 1672 KB Output is correct
25 Correct 0 ms 1672 KB Output is correct
26 Correct 0 ms 1672 KB Output is correct
27 Correct 0 ms 1672 KB Output is correct
28 Correct 0 ms 1672 KB Output is correct
29 Correct 0 ms 1672 KB Output is correct
30 Correct 0 ms 1672 KB Output is correct
31 Correct 0 ms 1672 KB Output is correct
32 Correct 0 ms 1672 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1672 KB Output is correct
2 Correct 0 ms 1672 KB Output is correct
3 Correct 0 ms 1672 KB Output is correct
4 Correct 0 ms 1672 KB Output is correct
5 Correct 0 ms 1672 KB Output is correct
6 Correct 0 ms 1672 KB Output is correct
7 Correct 0 ms 1672 KB Output is correct
8 Correct 0 ms 1672 KB Output is correct
9 Correct 0 ms 1672 KB Output is correct
10 Correct 0 ms 1672 KB Output is correct
11 Correct 0 ms 1672 KB Output is correct
12 Correct 0 ms 1672 KB Output is correct
13 Correct 0 ms 1672 KB Output is correct
14 Correct 0 ms 1672 KB Output is correct
15 Correct 0 ms 1672 KB Output is correct
16 Correct 0 ms 1672 KB Output is correct
17 Correct 0 ms 1672 KB Output is correct
18 Correct 0 ms 1672 KB Output is correct
19 Correct 0 ms 1672 KB Output is correct
20 Correct 0 ms 1672 KB Output is correct
21 Correct 0 ms 1672 KB Output is correct
22 Correct 0 ms 1672 KB Output is correct
23 Correct 0 ms 1672 KB Output is correct
24 Correct 0 ms 1672 KB Output is correct
25 Correct 0 ms 1672 KB Output is correct
26 Correct 0 ms 1672 KB Output is correct
27 Correct 0 ms 1672 KB Output is correct
28 Correct 0 ms 1672 KB Output is correct
29 Correct 0 ms 1672 KB Output is correct
30 Correct 0 ms 1672 KB Output is correct
31 Correct 0 ms 1672 KB Output is correct
32 Correct 0 ms 1672 KB Output is correct
33 Correct 0 ms 1672 KB Output is correct
34 Correct 0 ms 1672 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1672 KB Output is correct
2 Correct 0 ms 1672 KB Output is correct
3 Correct 0 ms 1672 KB Output is correct
4 Correct 0 ms 1672 KB Output is correct
5 Correct 0 ms 1672 KB Output is correct
6 Correct 0 ms 1672 KB Output is correct
7 Correct 0 ms 1672 KB Output is correct
8 Correct 0 ms 1672 KB Output is correct
9 Correct 0 ms 1672 KB Output is correct
10 Correct 0 ms 1672 KB Output is correct