Submission #2761

#TimeUsernameProblemLanguageResultExecution timeMemory
2761gs13068속이기 (GA5_fake)C++98
100 / 100
0 ms1092 KiB
#include<cstdio>
#include<algorithm>

int a[1000];

int main()
{
  int t=0;
  int i,n;
  scanf("%d",&n);
  for(i=0;i<n;i++)
  {
    scanf("%d",&a[i]);
    t^=a[i];
  }
  if(t)puts("0");
  else
  {
    t=0;
    std::sort(a,a+n);
    for(i=1;i<n;i++)t+=a[i];
    printf("%d",t);
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...