Pagini recente » Cod sursa (job #378608) | Cod sursa (job #760288) | Cod sursa (job #461423) | Arhiva de probleme | Cod sursa (job #1964357)
#include <iostream>
#include <fstream>
#include <vector>
#define mod 11311
#define FOR(i, x, y) for(int i = x; i <= y; ++i)
#define pb(x) push_back(x)
using namespace std;
vector <int> v[mod + 2];
void sterge(int x)
{
int p = -1;
if(v[x % mod].size() != 0)
FOR(i, 0, v[x % mod].size() - 1)
if(v[x % mod][i] == x){
p = i;
break;
}
if(p != -1) v[x % mod].erase(v[x % mod].begin() + p);
}
int gaseste(int x)
{
if(v[x % mod].size() != 0)
FOR(i, 0, v[x % mod].size() - 1)
if(v[x % mod][i] == x) return 1;
return 0;
}
int main()
{
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n, q, x;
fin >> n;
FOR(i, 1, n){
fin >> q >> x;
if(q == 1 && !gaseste(x)) v[x % mod].pb(x);
if(q == 2) sterge(x);
if(q == 3)
fout << gaseste(x) << '\n';
}
return 0;
}