* Problem: Gym 100818F Problem F Irrational Roots
http://codeforces.com/gym/100818/attachments
给n个数,都是id,其中有一个id的出现次数无法被k整除
卡时间和内存
当时是hash过的
后来问了下直接sort也能过,
还有一种是位运算统计
hash:
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <iostream>
using namespace std;
const double pi=acos(-1.0);
double eps=0.000001;
int aa[1000000];
int bb[32000];
const int hasnum=31999;
int main()
{
int n,k;
cin>>n>>k;
int x;
for (int i=0; i<n; i++)
{
scanf("%d",&x);
aa[i]=x;
}
for (int i=0; i<n; i++)
{
bb[aa[i]%hasnum]++;
}
int ans;
for (int i=0; i<hasnum; i++)
{
if (bb[i]%k!=0)
{
ans=i;
break;
}
}
memset(bb,0,sizeof bb);
for (int i=0; i<n; i++)
{
if (aa[i]%hasnum==ans)
{
bb[aa[i]/hasnum]++;
}
}
for (int i=0; i<hasnum; i++)
{
if (bb[i]%k!=0)
{
ans=i*hasnum+ans;
}
}
printf("%d\n",ans);
return 0;
}
位运算:
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <iostream>
using namespace std;
const double pi=acos(-1.0);
double eps=0.000001;
int ac[105];
int main()
{
// freopen("1.txt","r",stdin);
int n,k;
cin>>n>>k;
memset(ac,0,sizeof(ac));
for(int i=0; i<n; ++i)
{
int v;
scanf("%d",&v);
for(int j=0; j<32; ++j)
{
if( (1<<j) &v )
ac[j]++;
}
}
int ans=0;
for(int i=0; i<32; ++i)
{
if(ac[i]%k!=0) ans|=(1<<i);
}
printf("%d\n",ans);
return 0;
}