Pagini recente » Cod sursa (job #2106969) | Cod sursa (job #3120885) | Cod sursa (job #1470976) | Borderou de evaluare (job #1036684) | Cod sursa (job #1401079)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,m,pos,nr,md,x,l,z,aux;
vector <int> a[999999];
bool check (int li)
{
int i,t=0;
for (i=0;i<a[li].size();i++)
if (a[li][i]==nr) {pos=i;t=1;break;}
return t;
}
int main()
{
int i;
f>>n;
md=999983;
for (i=1;i<=n;i++)
{
pos=0;
f>>x>>nr;
l=nr%md;
if (x==1)
{
z=check (l);
if (z==0)
{
a[l].push_back(nr);
}
}
if (x==2)
{
z=check (l);
if (z==1)
{
a[l][pos]=aux;
a[l][pos]=a[l][a[l].size()-1];
a[l][a[l].size()-1]=aux;
a[l].pop_back();
}
}
if (x==3)
{
z=check (l);
g<<z<<"\n";
}
}
return 0;
}