Cod sursa(job #1850950)
| Utilizator | Data | 19 ianuarie 2017 04:26:32 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <map>
#include <stdio.h>
using namespace std;
int n, nr;
map<int, int> M;
int main()
{
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int i, tip, x;
fin>>n;
for(i = 1 ; i <= n ; i++)
{
fin>>tip>>x;
if(tip == 1 && M.find(x) == M.end()) M[x] = ++nr;
if(tip == 2) M.erase(x);
if(tip == 3) {
int ans = (M.find(x) != M.end());
fout<<ans<< "\n";
}
}
fin.close();
fout.close();
return 0;
}
