Pagini recente » Cod sursa (job #2082207) | Cod sursa (job #873415) | Cod sursa (job #639625) | Cod sursa (job #1467389) | Cod sursa (job #2624171)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int mod = 66666;
vector<int> h[mod];
void inserare(int x)
{
h[x % mod].push_back(x);
}
void stergere(int x){
int m = x % mod;
for (int i = 0; i < h[m].size(); i++)
{
if(h[m][i] == x)
{
h[m].erase(h[m].begin()+i);
}
}
}
int cautare(int x){
int m = x % mod;
for (int i = 0; i < h[m].size(); i++)
{
if(h[m][i] == x)
{
return 1;
}
}
return 0;
}
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, x, y;
f>>n;
for(int i = 0; i < n; i++){
f >> x >> y;
if(x == 1)
inserare(y);
if(x == 2)
stergere(y);
if(x == 3)
g << cautare(y) << '\n';
}
f.close();
g.close();
return 0;
}