Pagini recente » Cod sursa (job #2312762) | Cod sursa (job #324535) | Cod sursa (job #3169290) | Cod sursa (job #1822378) | Cod sursa (job #3230323)
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
#define mod 666013
vector <int> v[mod];
int c,x,m,k;
bool findx(int x)
{
int k=x%mod;
for(auto a:v[k])
{
if(a==x) return 1;
}
return 0;
}
void inserare(int x)
{
int k=x%mod;
v[k].push_back(x);
}
void stergere(int x)
{
int k=x%mod;
vector <int> u;
for(auto a:v[k])
{
if(a!=x) u.push_back(x);
}
v[k]=u;
}
int main()
{
f>>m;
for(int i=1;i<=m;++i)
{
f>>c>>x;
k=i%mod;
if(c==1) inserare(x);
else if(c==2) stergere(x);
else g<<findx(x)<<'\n';
}
return 0;
}