Submission #2884

#TimeUsernameProblemLanguageResultExecution timeMemory
2884pl0892029속이기 (GA5_fake)C++98
100 / 100
0 ms1092 KiB
#include <cstdio> int arr[1000]; int min(int a,int b) { return a<b ? a:b; } int main() { int n, sum=0, XOR=0; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",arr+i); sum += arr[i]; XOR ^= arr[i]; } int minElement = 0x7fffffff; for(int i=0;i<n;i++) minElement = min(minElement,arr[i]); printf("%d", XOR == 0 ? sum-minElement : 0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...