Cod sursa(job #1412775)
Utilizator | Data | 1 aprilie 2015 15:32:50 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
#include<map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int N,NR;
map<int,int>M;
int main()
{
int i,tip,x;
f>>N;
for(i=1;i<=N;i++)
{
f>>tip>>x;
if(tip==1&&M.find(x)==M.end())
M[x]=++NR;
if(tip==2)
M.erase(x);
if(tip==3)
if(M.find(x)!=M.end())
g<<1<<"\n";
else
g<<0<<"\n";
}
return 0;
}