Pagini recente » Borderou de evaluare (job #2781628) | Istoria paginii utilizator/cora2000 | Rating Serban Andrei Stan (serbanstan) | Istoria paginii preoni-2008/runda-4/solutii/carnati | Cod sursa (job #2627517)
#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int>V;
int search(int n)
{
vector<int>::iterator it;
for(it=V.begin();it!=V.end(); ++ it)
{
if(*it == n)
return 1;
}
return 0;
}
int add(int n)
{
if(!search(n))
V.push_back(n);
}
void del(int n)
{
vector<int>::iterator it;
for(it = V.begin(); it != V.end(); it ++)
{
if(*it == n)
{
V.erase(it);
break;
}
}
}
int main()
{
int n, op, nr;
f>>n;
for(int i=0;i<n;i++)
{
f>>op>>nr;
switch(op)
{
case 1:
add(nr);
break;
case 2:
if (search(nr)) del(nr);
break;
case 3:
g << search(nr) << '\n';
}
}
return 0;
}