# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90119 | cs71107 | 속이기 (GA5_fake) | C++14 | 20 ms | 1552 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 <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<int, pii> piii;
const int INF = 1e9+1;
const int MAXN = 1e5+10;
int main()
{
int n,x;
int totxor = 0;
ll sum = 0,mn = INF;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
totxor^=x;
mn = min((ll)x,mn);
sum+=(ll)x;
}
if(totxor)printf("0");
else printf("%lld",sum-mn);
return 0;
}
Compilation message (stderr)
# | 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... |