Pagini recente » Cod sursa (job #1482879) | Cod sursa (job #2410714) | Cod sursa (job #2007871) | Cod sursa (job #1979044) | Cod sursa (job #2596960)
#include <iostream>
#include <fstream>
#include <list>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
const int MOD=666013;
list <int> li[MOD+1];
int n;
struct elem
{
int tip;
int nr;
};
int main()
{
fin>>n;
for(int k=1; k<=n; k++)
{
elem crt;
fin>>crt.tip>>crt.nr;
int i=crt.nr%MOD;
if(crt.tip==1)
li[i].insert(li[i].begin(), crt.nr);
else
if(crt.tip==2)
{
for(auto it=li[i].begin(); it!=li[i].end(); )
{
if(*it==crt.nr)
{
auto it2=it;
it++;
li[i].erase(it2);
}else
it++;
}
}else
{
bool ok=0;
for(auto it=li[i].begin(); it!=li[i].end(); it++)
if(*it==crt.nr)
ok=1;
if(ok==1)
fout<<1<<"\n";
else
fout<<0<<"\n";
}
}
return 0;
}