Pagini recente » Istoria paginii runda/untitled1/clasament | Istoria paginii utilizator/florea.florin | Cod sursa (job #339919) | Cod sursa (job #2282392) | Cod sursa (job #2282389)
#include <bits/stdc++.h>
using namespace std;
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
unordered_set<int> S;
int main(){
InParser in("hashuri.in");
ofstream out("hashuri.out");
int n;
in>>n;
while(n--){
int tip,x;
in>>tip>>x;
if(tip==1) S.insert(x);
else if(tip==2) S.erase(x);
else out<<(S.find(x)!=S.end())<<"\n";
}
return 0;
}