Pagini recente » Cod sursa (job #1836576) | Cod sursa (job #3271316) | Cod sursa (job #763905) | Cod sursa (job #262755) | Cod sursa (job #3216450)
#include <iostream>
#include <vector>
#include <fstream>
#define MOD 666013
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
vector <long long> mult[MOD];
int gaseste(long long x)
{
long long ind = x % MOD;
for(int i = 0 ; i < mult[ind].size() ; i++)
{
if(mult[ind][i] == x)
{
return i;
}
}
return -1;
}
void adauga(long long x)
{
long long ind = x % MOD;
if(gaseste(x) == -1)
{
mult[ind].push_back(x);
}
}
void sterge(long long x)
{
long long ind = x % MOD;
long long val = gaseste(x);
//cout << val << "\n\n";
if(val != -1)
{
mult[ind].erase(mult[ind].begin() + val);
}
}
int main()
{
int n;
in >> n;
for(int i = 0 ; i < n ; i++)
{
int op;
long long x;
in >> op >> x;
if(op == 1)
{
adauga(x);
}
if(op == 2)
{
sterge(x);
}
if(op == 3)
{
out << (gaseste(x) != -1 ? 1 : 0) << "\n";
}
}
return 0;
}