Cod sursa(job #2194828)
Utilizator | Data | 14 aprilie 2018 13:47:10 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
set<int> s;
int main()
{
int N, i, q, x;
f>>N;
for(i=0;i<N;i++)
{
f>>q>>x;
if(q==1)
s.insert(x);
else if(q==2)
s.erase(x);
else
g<<s.count(x)<<'\n';
}
return 0;
}