Pagini recente » Cod sursa (job #2772065) | Diferente pentru fmi-no-stress-2012/solutii/cercuri4 intre reviziile 5 si 4 | Cod sursa (job #1002092) | Monitorul de evaluare | Cod sursa (job #2772060)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> H[999983];
int main()
{
int N,op,x,a;
f>>N;
for(a=1; a<=N; a++)
{
f>>op>>x;
int i=x%999983;
if(op==1)
{
int ok=0;
for(int j=0; j<H[i].size(); j++)
if(x==H[i][j])
{
ok=1;
break;
}
if(ok==0)
H[i].push_back(x);
}
else if(op==2)
for(int j=0; j<H[i].size(); j++)
if(x==H[i][j])
{
H[i][j]=H[i][H[i].size()-1];
H[i].pop_back();
break;
}
else
{
int ok=0;
for(int j=0; j<H[i].size(); j++)
if(x==H[i][j])
{
ok=1;
break;
}
if(ok==1)
g<<"1\n";
else
g<<"0\n";
}
}
return 0;
}