| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 8813 | gs14004 | 속이기 (GA5_fake) | C++98 | 0 ms | 1088 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 <cstdio>
int n,t,h,m=1e6,cnt[20];
int main(){
scanf("%d",&n);
for (int i=0; i<n; i++) {
scanf("%d",&t);
h += t;
if(m > t) m = t;
int piv = 0;
while (t) {
if(t&1) cnt[piv]++;
t >>= 1;
piv++;
}
}
for (int i=0; i<20; i++) {
if(cnt[i]&1){
puts("0");return 0;
}
}
printf("%d",h-m);
}| # | 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... | ||||
