Pagini recente » Cod sursa (job #3269342) | Cod sursa (job #2744229) | Cod sursa (job #169195) | Cod sursa (job #1990778) | Cod sursa (job #2472463)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("hashuri.in");
ofstream out ("hashuri.out");
#define M 666013
int v[M][100];
int main()
{
int n, i, p, x, ok, j;
in >> n;
for (i=0; i<n; i++)
{
in >> p >> x;
if (p==1)
{
ok=0;
for (j=1; j<=v[x%M][0] && ok==0; j++) if (v[x%M][j]==x) ok=1;
if (ok==0)
{
v[x%M][0]++;
v[x%M][v[x%M][0]]=x;
}
}
else if (p==2)
{
for (j=1; j<=v[x%M][0]; j++) if (v[x%M][j]==x) {for (int k=j; k<v[x%M][0]; k++) v[x%M][k]=v[x%M][k+1]; v[x%M][0]--;}
}
else if (p==3)
{
ok=0;
for (j=1; j<=v[x%M][0]; j++) if (v[x%M][j]==x) {ok=1; out << "1\n";}
if (ok==0) out << "0\n";
}
}
return 0;
}