Pagini recente » Cod sursa (job #2867669) | Cod sursa (job #1264132) | Cod sursa (job #1024735) | Cod sursa (job #2928300) | Cod sursa (job #2193704)
#include <iostream>
#include <fstream>
#include <set>
#include <algorithm>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int MOD=1000000;
int n, c, x;
int a[1000000];
int main()
{
f>>n;
for (int i=1; i<=n; i++)
{
f>>c>>x;
if (c==1) a[x%MOD]++;
if (c==2) a[x&MOD]--;
if (c==3)
if (a[x%MOD]>0 && a[x%MOD]<3) g<<1<<"\n";
else g<<0<<"\n";
}
return 0;
}