| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 2895 | jihoon | 속이기 (GA5_fake) | C++98 | 0 ms | 1092 KiB |
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>
int a[1000]={0};
int n;
int sum;
int x=0;
int min=10000000;
int main(){
int i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
if(min>a[i]) min=a[i];
sum+=a[i];
x=x^a[i];
}
if(x==0) printf("%d",sum-min);
else printf("0");
return 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... | ||||
