Pagini recente » Cod sursa (job #2970742) | Cod sursa (job #1597217) | Cod sursa (job #1095396) | Cod sursa (job #2266563) | Cod sursa (job #953176)
Cod sursa(job #953176)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
const int MAXN = 1000010, MOD = 1001;
vector <long long> has[MOD];
int N, poz, x, val;
bool apartine(int aux, int val)
{
int i;
bool ok = 0;
for(i=0; i<has[aux].size(); ++i)
if(has[aux][i] == val)
{
poz = i;
ok = 1;
break;
}
return ok;
}
int main()
{
int i, aux;
bool aux2;
fin >> N;
for(i=0; i<N; ++i)
{
fin >> x >> val;
aux = val%MOD;
if(x == 1)
has[aux].push_back(val);
else if(x == 2)
{
aux2 = apartine(aux, val);
if(aux2 == 1)
has[aux][poz] = 0;
}
else
{
aux2 = apartine(aux, val);
if(aux2 == 1)
fout << 1 << "\n";
else
fout << 0 << "\n";
}
}
fin.close();
fout.close();
return 0;
}