Cod sursa(job #2661693)
| Utilizator | Data | 22 octombrie 2020 15:46:28 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,t,x;
unordered_set<int> s;
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);///f>>n;
for(; n; n--)
{
scanf("%d%d",&t,&x);///f>>t>>x;
if(t==1)
s.insert(x);
else if(t==2)
s.erase(x);
else if(s.find(x)==s.end())
printf("0\n");///g<<"0\n";
else
printf("1\n");///g<<"1\n";
}
return 0;
}
