Pagini recente » Cod sursa (job #541239) | Cod sursa (job #3192249) | Cod sursa (job #516278) | Cod sursa (job #967638) | Cod sursa (job #2419038)
#include <bits/stdc++.h>
#define B1 37
#define B2 29
#define MOD 1000019
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n;
void solve();
int v1[MOD+10];
int v2[MOD+10];
int main()
{solve();
return 0;
}
void solve()
{
int i,c,nr,p;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>c>>nr;
int val1=0,val2=0;
for(p=1;p<=nr;p++)
{
val1=(val1*B1+nr/p%10)%MOD;
val2=(val2*B2+nr/p%10)%MOD;
}
if(c==1 && !v1[val1] && !v2[val2])
{
v1[val1]++;
v2[val2]++;
}
if(c==2 && v1[val1] && v2[val2])
{
v1[val1]--;
v2[val2]--;
}
if(c==3)
{if(v1[val1] && v2[val2])
fout<<1<<'\n';
else
fout<<0<<'\n';
}
}
}