Pagini recente » Cod sursa (job #2187807) | Cod sursa (job #2592998) | Autentificare | Cod sursa (job #2185642) | Cod sursa (job #2596958)
#include <iostream>
#include <list>
#include <fstream>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
struct elem_cit
{
int tip;
int val;
};
const int MOD = 666013;
list <int> v[MOD];
int n;
elem_cit a;
int main()
{
fin >> n;
auto it=v[a.val%MOD].begin();
for (int i=0;i<n;++i)
{
fin >> a.tip >> a.val;
if (a.tip==1)
{
bool ok=false;
for (auto it = v[a.val%MOD].begin(); it != v[a.val%MOD].end(); it++)
{
if (*it==a.val)
{
ok=true;
break;
}
}
if (!ok)
v[a.val%MOD].insert(v[a.val%MOD].begin(),a.val);
}
else if (a.tip==2)
{
for (auto it = v[a.val%MOD].begin(); it != v[a.val%MOD].end(); it++)
{
if (*it==a.val)
{
v[a.val%MOD].erase(it);
break;
}
}
}
else if (a.tip==3)
{
bool ok=false;
for (auto it = v[a.val%MOD].begin(); it != v[a.val%MOD].end(); it++)
{
if (*it==a.val)
{
ok=true;
fout << "1\n";
break;
}
}
if (!ok)
fout << "0\n";
}
}
return 0;
}