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