Pagini recente » Cod sursa (job #1035275) | Cod sursa (job #660509) | Cod sursa (job #665400) | Cod sursa (job #1460315) | Cod sursa (job #2259869)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
const int MOD=666013;
vector <int> h[MOD+100];
int hash_brut(int k)
{
return k%MOD;
}
int find_value(int key, int x)
{
for(int i=0;i<h[key].size();i++)
{
if(h[key][i]==x)
return i;
}
return -1;
}
int main()
{
int n, i, x, val, key, p;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>val;
fin>>x;
key=hash_brut(x);
p=find_value(key, x);
if(val==1)
{
if(p==-1)
h[key].push_back(x);
}
if(val==2)
{
if(p!=-1)
h[key].erase(h[key].begin()+p);
}
if(val==3)
{
if(p!=-1)
fout<<"1"<<"\n";
else
fout<<"0"<<"\n";
}
}
return 0;
}