Pagini recente » Cod sursa (job #1346885) | Cod sursa (job #1076136) | Cod sursa (job #2086772) | Cod sursa (job #273683) | Cod sursa (job #2810265)
#include <iostream>
#include <fstream>
#include <vector>
#define MODULO 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,t,a;
vector <vector <int>> v(MODULO);
int searcht (int n)
{
int i=n%MODULO,ok=0;
for (int j=0; j<v[i].size() && ok==0; j++)
{
//cout<<v[i][j]<<' ';
if (v[i][j]==n)
{
return j;
}
}
//cout<<'\n';
return v[i].size()+1;
}
int main()
{
f>>n;
for (int r=1; r<=n;r++)
{
f>>t>>a;
if (t==1)
{
int i=a%MODULO;
if (searcht(a)==v[i].size()+1)
v[i].push_back(a);
}
else if (t==2)
{
int i=a%MODULO,poz=searcht(a);
if (poz<v[i].size())
v[i].erase(v[i].begin()+poz);
}
else
{
int i=a%MODULO;
if (searcht(a)==v[i].size()+1)
g<<0<<'\n';
else g<<1<<'\n';
}
}
return 0;
}