Cod sursa(job #2903203)
| Utilizator | Data | 17 mai 2022 11:24:41 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n;
set<int> M;
int main()
{
int i;
fin >> n;
int task, x;
for( i=1; i<=n; i++ )
{
fin >> task >> x;
if( task == 1 )
M.insert(x);
if( task == 2 )
M.erase(x);
if( task == 3 )
if( M.find(x) != M.end() ) fout << "1\n";
else fout << "0\n";
}
return 0;
}
