Cod sursa(job #3162440)
| Utilizator | Data | 29 octombrie 2023 11:39:38 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
//Problema palindrom
bool apare[2000001];
int i,x;
set<int> M;
//refac arhitect cu set
bool exista(int x)
{
if(M.count(x)!=0)
return 1;
return 0;
}
int main()
{
long long int N, op;
fin>>N;
for(i=1;i<=N;i++)
{
fin>>op>>x;
if(op==1)
{
M.insert(x);
}
else if(op==2)
{
M.erase(x);
}
else if(op==3) fout<<exista(x)<<'\n';
}
}
