Pagini recente » Cod sursa (job #3157519) | Cod sursa (job #719884) | Cod sursa (job #1325453) | Cod sursa (job #1437566) | Cod sursa (job #1426849)
#include <fstream>
#define MOD 666013
#include <vector>
#include <map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
map <int,int> G;
int n,i,x,op,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>op>>x;
if(op==1)
if(G.find(x)==G.end())
G[x]=++k;
if(op==2)
G.erase(x);
if(op==3)
{
if(G.find(x)==G.end())
fout<<0<<'\n';
else
fout<<1<<'\n';
}
}
return 0;
}