Pagini recente » Cod sursa (job #1254672) | Cod sursa (job #1974225) | Cod sursa (job #125401) | Cod sursa (job #447685) | Cod sursa (job #2675366)
#include <iostream>
#include<vector>
#include<fstream>
using namespace std;
const int MOD = 666013;
void insert(int x, vector<vector<int>>& v)
{
int fx = x % MOD;
bool isThere = false;
for(auto &elem: v[fx]) {
if (elem == x)
isThere = true;
}
if(!isThere)
{
v[fx].push_back(x);
}
}
void erase(int x, vector<vector<int>>& v)
{
int fx = x % MOD;
bool isThere = false;
vector<int> aux;
for(auto &elem: v[fx]) {
if (elem == x)
isThere = true;
else
aux.push_back(elem);
}
if(isThere)
{
v[fx] = aux;
}
}
int find(int x, vector<vector<int>>& v)
{
int fx = x % MOD;
bool isThere = false;
for(auto &elem: v[fx]) {
if (elem == x)
isThere = true;
}
return isThere;
}
int main() {
vector<vector<int>> v(MOD);
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int N;
fin>>N;
for(int i = 0; i < N; i ++){
int tip, x;
fin>>tip>>x;
if(tip == 1)
insert(x, v);
else if(tip == 2)
erase(x, v);
else
fout<<find(x, v)<<"\n";
}
return 0;
}