Cod sursa(job #1909905)
Utilizator | Data | 7 martie 2017 14:36:14 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <map>
#include <fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
map <int,int> a;
int n,c,nr,i;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>c>>nr;
if(c==1)
{
a[nr]=1;
}
else
if(c==2)
a[nr]=0;
else
{
if(a[nr])
g<<1<<"\n";
else
g<<0<<"\n";
}
}
return 0;
}