Skip to content

Instantly share code, notes, and snippets.

@erjiaqing
Created March 27, 2014 00:13
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
Star You must be signed in to star a gist
Save erjiaqing/9796898 to your computer and use it in GitHub Desktop.
Accepted/132K/0MS
#include <functional>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <fstream>
#include <utility>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int n,num[120],x,flag;
while ((~scanf("%d",&n)) && n)
{
memset(num,0,sizeof(num));
for (int i=0;i<n;i++)
{
scanf("%d",&x);
num[x]++;
}
flag=0;
for (int i=1;i<=100;i++)
{
if (num[i] & 1)
{
flag=1;
break;
}
}
printf("%d\n",flag);
}
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment