Pagini recente » Statistici Fota David (fotadavid) | Cod sursa (job #2255319) | Cod sursa (job #1094834) | Cod sursa (job #2442908) | Cod sursa (job #2507965)
#include <fstream>
#include <vector>
using namespace std;
const int prim=999983;
vector <int> v[prim];
ifstream in ("hashuri.in");
ofstream out ("hashuri.out");
bool check (int x)
{
int i,k=x%prim;
for (i=0;i<v[k].size();++i)
if (v[k][i]==x)
return 1;
return 0;
}
void add (int x)
{
int i,k=x%prim;
for (i=0;i<v[k].size();++i)
if (v[k][i]==x)
return;
v[k].push_back(x);
}
void my_erase(int x)
{
int i,k=x%prim;
for (i=0;i<v[k].size();++i)
if (v[k][i]==x)
v[k].erase(v[k].begin()+i);
}
int main()
{
int n,i,a,b;
in>>n;
for (i=1;i<=n;i++)
{
in>>a>>b;
if (a==1)
add(b);
else if (a==2)
my_erase(b);
else
out<<check(b)<<'\n';
}
return 0;
}