Pagini recente » Cod sursa (job #1137712) | Cod sursa (job #580015) | Cod sursa (job #1523971) | Cod sursa (job #1180518) | Cod sursa (job #2737846)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[100017];
int x, y, n, cheie, ok, cheiemaxim;
int operatie_tip_3()
{
for(int i = 0; i < v[cheie].size(); i++)
{
if(v[cheie][i] == y)
return 1;
}
return 0;
}
void operatie_tip_2()
{
for(int i = 0; i < v[cheie].size(); i++)
{
if(v[cheie][i] == y)
{
v[cheie].erase(v[cheie].begin() + i);
return;
}
}
}
void operatie_tip_1()
{
/*ok = 0;
for(int i = 0; i < v[cheie].size(); i++)
{
if(v[cheie][i] == y)
{
ok = 1;
return;
}
}
if(ok == 0)*/
v[cheie].push_back(y);
}
int main()
{
f >> n; // numarul de operatii
for(int i = 0; i < n; i++)
{
f >> x >> y; // citim tipul operatiei, si numarul
cheie = y % 100007;
if(x == 1)
operatie_tip_1();
else if(x == 2)
operatie_tip_2();
else if(x == 3)
g << operatie_tip_3() << endl;
}
return 0;
}