Pagini recente » Cod sursa (job #41940) | Cod sursa (job #2598514) | Cod sursa (job #2009590) | Cod sursa (job #1832033) | Cod sursa (job #2222051)
#include <fstream>
#include <vector>
using namespace std;
const int mod = 666013;
vector<int> sir[666666];
int n, x, cer, p;
bool cnt;
int main()
{
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
fin >> n;
for (int i = 1; i <= n; ++i)
{
fin >> cer >> x;
p = x % mod;
if (cer == 1)
sir[p].push_back(x);
else if (cer == 2)
{
for (int i = 0; i < (int)sir[p].size(); ++i)
if (sir[p][i] == x)
{
sir[p].erase(sir[p].begin() + i);
break;
}
}
else
{
cnt = 0;
for (auto y: sir[p])
if (x == y)
{
cnt = 1;
break;
}
fout << cnt << '\n';
}
}
fin.close();
fout.close();
return 0;
}