Cod sursa(job #1097645)
Utilizator | Data | 3 februarie 2014 19:01:36 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
#include<map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int t,x,n,i;
map<int, int>m;
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>t>>x;
if(t==1)
m[x]=1;
if(t==2)
m.erase(x);
if(t==3)
g<<(m.find(x)!=m.end())<<'\n';
}
return 0;
}