Pagini recente » Cod sursa (job #2136005) | Cod sursa (job #2557193) | Cod sursa (job #2926556) | Cod sursa (job #419274) | Cod sursa (job #610641)
Cod sursa(job #610641)
#include <fstream>
#include <cstdio>
#include <vector>
using namespace std;
#define m 666013
int n,t,x,k;
vector<int> v[m];
inline vector<int>::iterator find (int x){
for(vector<int>::iterator i=v[k].begin();i<v[k].end();++i)
if(*i==x)
return i;
return v[k].end();}
int main ()
{
ifstream f ("hashuri.in");
freopen ("hashuri.out","w",stdout);
for(f>>n;n;--n){
f>>t>>x;
k=x%m;
if(t==1&&find(x)==v[k].end())
v[k].push_back(x);
if(t==2&&find(x)!=v[k].end())
v[k].erase(find(x));
if(t==3)
printf("%d\n",find(x)!=v[k].end());}
return 0;}