Pagini recente » Cod sursa (job #3127236) | Cod sursa (job #2554290) | Borderou de evaluare (job #1085087) | Cod sursa (job #2966405) | Cod sursa (job #2375905)
#include <iostream>
#include <fstream>
#include <set>
#define mod 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n;
set<int> h[mod];
int main()
{
fin>>n;
int z,x;
while(n--)
{
fin>>z>>x;
switch(z)
{
case 1:
h[x%mod].insert(x);
break;
case 2:
h[x%mod].erase(x);
break;
case 3:
if(h[x%mod].find(x)!=h[x%mod].end())
fout<<1<<"\n";
else
fout<<0<<"\n";
}
}
return 0;
}