Pagini recente » Cod sursa (job #2483526) | Cod sursa (job #1917539) | Cod sursa (job #28174) | Cod sursa (job #571932) | Cod sursa (job #1238796)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define mod 666013
vector < int > a[628975];
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
void del(int x)
{
for(int i=0;i<int(a[x%mod].size());i++)
if(a[x%mod][i]==x){
a[x%mod].erase(a[x%mod].begin() + i);
return;
}
}
bool c(int x)
{
for(int i=0;i<int(a[x%mod].size());i++)
if(a[x%mod][i]==x)
return 1;
return 0;
}
int main()
{
int t;
fin>>t;
while(t--)
{
int x,y;
fin>>x>>y;
if(x==1)
a[y%mod].push_back(y);
if(x==2)
del(y);
if(x==3)
fout<<c(y)<<"\n";
}
fin.close();
fout.close();
return 0;
}