Pagini recente » Cod sursa (job #1254587) | Cod sursa (job #1055775) | Cod sursa (job #1699298) | Cod sursa (job #1536226) | Cod sursa (job #2939048)
#include<fstream>
#include<cmath>
#include<vector>
#define P 999983
#define pb push_back
//#include<iostream>
using namespace std;
class InParser {
vector<char> str;
int ptr;
ifstream fin;
char getChar() {
if (ptr == int(str.size())) {
fin.read(str.data(), str.size());
ptr = 0;
}
return str[ptr++];
}
template<class T>
T getInt() {
char chr = getChar();
while (!isdigit(chr) && chr != '-')
chr = getChar();
int sgn = +1;
if (chr == '-') {
sgn = -1;
chr = getChar();
}
T num = 0;
while (isdigit(chr)) {
num = num * 10 + chr - '0';
chr = getChar();
}
return sgn * num;
}
public:
InParser(const char* name) : str(1e5), ptr(str.size()), fin(name) { }
~InParser() { fin.close(); }
template<class T>
friend InParser& operator>>(InParser& in, T& num) {
num = in.getInt<T>();
return in;
}
};
class OutParser {
vector<char> str;
int ptr;
ofstream fout;
void putChar(char chr) {
if (ptr == int(str.size())) {
fout.write(str.data(), str.size());
ptr = 0;
}
str[ptr++] = chr;
}
template<class T>
void putInt(T num) {
if (num < 0) {
putChar('-');
num *= -1;
}
if (num > 9)
putInt(num / 10);
putChar(num % 10 + '0');
}
public:
OutParser(const char* name) : str(1e5), ptr(0), fout(name) { }
~OutParser() { fout.write(str.data(), ptr); fout.close(); }
template<class T>
friend OutParser& operator<<(OutParser& out, const T num) {
out.putInt(num);
return out;
}
friend OutParser& operator<<(OutParser& out, const char chr) {
out.putChar(chr);
return out;
}
friend OutParser& operator<<(OutParser& out, const char* str) {
for (int i = 0; str[i]; i++)
out.putChar(str[i]);
return out;
}
};
InParser cin("hashuri.in");
OutParser cout("hashuri.out");
vector<int> h[P];
void adaugare(int x)
{
int r=x%P;
h[r].pb(x);
}
int cautare(int x)
{
int r = x % P;
unsigned i, L;
L = h[r].size();
for (i = 0; i < L; i++)
if (h[r][i] == x)
{
return 1;
}
return 0;
}
void eliminare(int x)
{
int r = x % P;
unsigned i, L;
L = h[r].size();
for (i = 0; i < L; i++)
if (h[r][i] == x)
{
h[r][i] = h[r][L-1];
h[r].pop_back();
return;
}
}
int main()
{
int n,x,y;
cin>>n;
for(;n;n--)
{
cin>>x>>y;
if(x==1)
adaugare(y);
else
if(x==2)
eliminare(y);
else
cout<<cautare(y)<<'\n';
}
}