Pagini recente » Cod sursa (job #2980792) | Cod sursa (job #2060051) | Cod sursa (job #2765123) | Cod sursa (job #2190779) | Cod sursa (job #1526997)
#include <iostream>
#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, tip, x, val,t;
vector <int> v[MOD+5];
int main()
{
f>>n;
for (;n;--n)
{
f>>tip>>x;
if (tip == 1)
{
val = x % MOD;
v[val].push_back(x);
}
else if (tip==2)
{
val = x % MOD;
for (vector<int>::iterator it = v[val].begin(); it!=v[val].end();++it)
{
if ((*it)==x)
{
(*it)=v[val].back();
v[val].pop_back();
break;
}
}
}
else
{
t=0;
val = x % MOD;
for (vector<int>::iterator it = v[val].begin(); it!=v[val].end();++it)
if ((*it) == x)
{
t=1;
break;
}
g<<t<<"\n";
}
}
return 0;
}