Pagini recente » Cod sursa (job #2814183) | Cod sursa (job #2466694) | Cod sursa (job #1248988) | Cod sursa (job #1096277) | Cod sursa (job #2895696)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
const int p = 44729;
int main()
{
int n, i, op, par,ok,j;
vector<vector<int>>v(p);
fin>>n;
for(i=0;i<n;i++)
{
fin>>op>>par;
switch(op)
{
case 1:
{
v[par%p].push_back(par);
break;
}
case 2:
{
for(j=0;j<v[par%p].size();j++)
if(v[par%p][j] == par)
{
swap(v[par%p][j], v[par%p][v[par%p].size()-1]);
v[par%p].pop_back();
}
break;
}
case 3:
{
ok=0;
for(j=0;j<v[par%p].size();j++)
if(v[par%p][j] == par)
{
fout<<1<<"\n";
ok=1;
break;
}
if(ok==0)
fout<<0<<"\n";
break;
}
}
}
fin.close();
fout.close();
return 0;
}