Cod sursa(job #3319042)
| Utilizator | Data | 30 octombrie 2025 13:04:53 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<bits/stdc++.h>
using namespace std;
#define fin cin
#define fout cout
unordered_map<int,bool> mp;
int main() {
int n;
fin>>n;
for (int i=1;i<=n;++i) {
int q,x;
fin>>q>>x;
if (q==1)
mp[x]=true;
else if (q==2)
mp[x]=false;
else if (q==3)
if (mp.count(x) && mp[x]==true)
fout<<1<<'\n';
else fout<<0<<'\n';
}
}