Submission #2869

#TimeUsernameProblemLanguageResultExecution timeMemory
2869ladown21속이기 (GA5_fake)C++98
100 / 100
0 ms1088 KiB
#include <stdio.h>
#include <algorithm>

int main()
{
	int N,A,M=0x7fffffff, S=0, XOR;
	scanf("%d",&N);
	for (int i=1; i<=N; i++) {
		scanf("%d",&A);
		M = std::min(M,A);
		S+=A;

		if (i==1) XOR=A;
		else XOR^=A;
	}
	printf("%d\n",(XOR==0?S-M: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...