Cod sursa(job #591152)
Utilizator | Data | 22 mai 2011 18:21:50 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.6 kb |
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
fstream in,out;
#define M 666057
vector <int> h[M];
int n,op;
int main()
{
int i,j,x;
in.open("hashuri.in",ios::in);
out.open("hashuri.out",ios::out);
in>>n;
for(i=0;i<n;i++)
{
in>>op>>x;
if(op==1)
{
int k=x%M,q=0;
for(j=0;j<h[k].size();j++)
{
if(h[k][j]==x){ q=1;
break;}
}
if(q==0) h[k].push_back(x);
}
if(op==2)
{
int k=x%M,q=0,pos;
for(j=0;j<h[k].size();j++)
{
if(h[k][j]==x){
q=1,pos=j;break;}
}
if(q==1){h[k].erase(h[k].begin()+j);}
}
if(op==3)
{
int k=x%M,q=0;
for(j=0;j<h[k].size();j++)
if(h[k][j]==x){q=1;
out<<1<<'\n';break;}
if(q==0)out<<0<<'\n';
}
}
in.close();out.close();
return 0;
}