Cod sursa(job #1364376)
| Utilizator | Data | 27 februarie 2015 17:19:47 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
map <int,int> m;
int main()
{
int n,i;
f>>n;
for(i=1;i<=n;i++)
{
int p,a;
f>>p;
if(p==1)
{
f>>a;
m[a]=1;
}
else
if(p==2)
{
f>>a;
if(m[a]) m.erase(a);
}
else
{
f>>a;
g<<m[a]<<'\n';
}
}
return 0;
}
