This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
int main()
{
int N,A,M=0x7fffffff, S=0, XOR;
scanf("%d",&N);
for (int i=1; i<=N; i++) {
scanf("%d",&A);
M = std::min(M,A);
S+=A;
if (i==1) XOR=A;
else XOR^=A;
}
printf("%d\n",(XOR==0?S-M:0));
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |