Cod sursa(job #1028844)
Utilizator | Data | 14 noiembrie 2013 19:06:56 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
#include<map>
using namespace std;
int n,nr=1,q,x,i;
map <int,int>v;
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>q>>x;
if(q==1 && v.find(x)==v.end()) v[x]=nr++;
if(q==2) v.erase(x);
if(q==3)
{
if(v.find(x)==v.end()) g<<0<<'\n';
else g<<1<<'\n';
}
}
}