Cod sursa(job #3211581)
Utilizator | Data | 9 martie 2024 16:06:13 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
map <int,int> m;
int i, j, n, x, op, k, sf, sff, in, p;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>op>>x;
if(op == 1)
m[x]=1;
if(op == 2)
m[x]=0;
if(op == 3)
{
if(m[x] == 1)
fout<<1<<endl;
else fout<<0<<endl;
}
}
}