Pagini recente » Cod sursa (job #1779100) | Cod sursa (job #111681) | Cod sursa (job #2719610) | Cod sursa (job #2242424) | Cod sursa (job #3132254)
#include <iostream>
#include <fstream>
using namespace std;
int list[666019], v[1000000], nex[1000000] , n, m = 666019;
ifstream read("hashuri.in");
ofstream w("hashuri.out");
bool is(int x)
{
int r, s;
r= x%m;
s = list[r];
while(s != 0)
{
if(v[s] == x)
return true;
m = nex[m];
}
return false;
}
int main()
{
int nr, i , z , y ,r,p;
read >> nr;
for(i = 1; i <= nr ; i++)
{
r >> z >> y;
if( z== 1)
{ r = y % m;
n++;
v[n] = y;
nex[n] = list[r];
list[r] = n;}
if(z == 2)
{
r = y % m;
p = list[r];
if(v[p] == y)
{
list[r] = nex[p];
} else{
while(nex[p] != 0)
{
if(v[nex[p]] == y)
nex[p] = nex[nex[p]];
else
p = nex[p];
}}
if(z == 3)
{
if(is(y))
w << 1 << '\n';
else
w << 0 << '\n';
}
}
}
return 0;
}