Pagini recente » Istoria paginii runda/lee-clsx | Cod sursa (job #2576054) | Istoria paginii runda/summer_contest_2 | Istoria paginii runda/simulare_oji_10_4 | Cod sursa (job #1047766)
#include<fstream>
#include<vector>
using namespace std;
#define prim 666013
vector<int>H[prim];
int op3(int val)
{int rest=val%prim;
int n=H[rest].size();
for(int i=0;i<n;i++)
if(H[rest][i]==val)
return i;
return -1;
}
int op1(int val)
{int rest=val%prim;
if(op3(val)!=-1)return 0;
H[rest].push_back(val);
}
int op2(int val)
{int rest=val%prim;
int i=op3(val);
if(i==-1)return 0;
H[rest][i]=H[rest].back();
H[rest].pop_back();
}
int main()
{int i,n,op,x;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
for(i=1;i<=n;i++)
{f>>op;
f>>x;
if(op==1)
op1(x);
if(op==2)
op2(x);
if(op==3)
if(op3(x)!=-1)
g<<1<<endl;
else
g<<0<<endl;
}
f.close();
f.close();
return 0;
}