Cod sursa(job #2580350)
| Utilizator | Data | 13 martie 2020 15:16:01 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <unordered_map>
#define Nmax 1000005
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int,int> m;
int n;
int main()
{
int i,p,a;
fin>>n;
for (i=1;i<=n;i++)
{
fin>>p>>a;
if (p==1)
m[a]=1;
if (p==2)
m.erase(a);
if (p==3)
if (m.find(a)!=m.end())
fout<<1<<"\n";
else
fout<<0<<"\n";
}
return 0;
}
