Pagini recente » Cod sursa (job #1328740) | Cod sursa (job #1274340) | Cod sursa (job #138568) | Cod sursa (job #2754340) | Cod sursa (job #607570)
Cod sursa(job #607570)
# include <fstream>
# include <vector>
using namespace std;
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
const int MOD = 666013;
vector <int> A[MOD];
int n, x, y;
inline vector <int> :: iterator cauta (int y)
{
int nr = y % MOD;
vector <int> :: iterator it;
for (it = A[nr].begin (); it != A[nr].end (); ++it)
if (*it == y)
return it;
return A[nr].end ();
}
void insereaza (int y)
{
int nr = y % MOD;
if (cauta (y) == A[y].end ())
A[nr].push_back (y);
}
void sterge (int y)
{
int nr = y % MOD;
vector <int> :: iterator it = cauta (y);
if (it != A[y].end ())
A[nr].erase (it);
}
int main ()
{
f >> n;
for (; n > 0; --n)
{
f >> x >> y;
if (x == 1)
insereaza (y);
else
if (x == 2)
sterge (y);
else
g << (cauta (y) != A[y % MOD].end ()) << '\n';
}
}