Pagini recente » Cod sursa (job #1671338) | Cod sursa (job #1643181) | Cod sursa (job #2599966) | Cod sursa (job #2631192) | Cod sursa (job #899734)
Cod sursa(job #899734)
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
FILE*in=fopen("hashuri.in","r");
FILE*out=fopen("hashuri.out","w");
vector<int> v[666013];
int main()
{
int nr,type,nur;
fscanf(in,"%d",&nur);
for(int oo=1;oo<=nur;++oo)
{
fscanf(in,"%d%d",&type,&nr);
if(type==1)
{
int modulo=nr%666013;
bool OK=true;
for(int i=0;i<(int)v[modulo].size();++i)
if(v[modulo][i]==nr)
{
OK=false;
break;
}
if(OK)
v[modulo].push_back(nr);
}
else
if(type==2)
{
int modulo=nr%666013;
for(int i=0;i<(int)v[modulo].size();++i)
if(v[modulo][i]==nr)
{
v[modulo].erase(v[modulo].begin()+i);
break;
}
}
else
if(type==3)
{
int modulo=nr%666013;
bool OK=true;
for(int i=0;i<(int)v[modulo].size();++i)
if(v[modulo][i]==nr)
{
OK=false;
fprintf(out,"1\n");
break;
}
if(OK)
fprintf(out,"0\n");
}
}
fclose(in);
fclose(out);
return 0;
}