Pagini recente » Cod sursa (job #1691795) | Cod sursa (job #2748347)
#include<vector>
#include<fstream>
using namespace std;
const int nr=10000;
vector<int> v[nr];
int gaseste_element(int n)
{ int tr=0;
int h=n%nr;
for(int i = 0; i < v[nr].size(); i++ )
if( v[nr][i] == n )
tr=1;
}
void adauga(int n)
{
int h=n%nr;
for(int i=0; i < v[h].size(); i++)
if(v[h][i] == n)
{
v[h].erase(v[h].begin() + i);
return;
}
}
void sterge(int n)
{
int h=n%nr;
for(int i = 0; i < v[h].size(); i++ )
if( v[h][i] == n )
return;
v[h].push_back(n);
}
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int tr,tip,n,x;
f>>n;
for(int i=0; i<n; i++)
{
f>>x;
g<<"Introduceti cerinta pentru meniu:"<<endl;
f>>tip;
switch(tip){
case 1:
{
adauga(x);}
case 2:
{
sterge(x);}
case 3:
gaseste_element(x)<<'\n';
if (tr==1)
g<<"Element gasit.";
}
};
return 0;
}