Pagini recente » Cod sursa (job #1724034) | Cod sursa (job #423244) | Cod sursa (job #1848902) | Cod sursa (job #1064513) | Cod sursa (job #2883595)
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n;
const int const1=100005;
set<long long>v[const1];
int main(){
f>>n;
for (int i=1; i<=n; i++){
int op, nr;
f>>op>>nr;
if (op==1){
v[nr % const1].insert(nr);
}
else if (op == 2){
if (v[nr%const1].find(nr) != v[nr%const1].end())
v[nr%const1].erase(nr);
}
else if (op==3){
if (v[nr%const1].find(nr)!= v[nr%const1].end())
g<<1<<"\n";
else
g<<0<<"\n";
}
}
return 0;
}