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>
long long int s,t,a[1004],m=-1;
int n;
int main()
{
int i, j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lld",&a[i]);
s+=a[i];
t^=a[i];
if(m<0||m>a[i])m=a[i];
}
if(t==0)printf("%lld\n",s-m);
else printf("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... |