Pagini recente » Cod sursa (job #1906929) | Cod sursa (job #735969) | Cod sursa (job #1800933) | Cod sursa (job #279416) | Cod sursa (job #644382)
Cod sursa(job #644382)
#include<vector>
#include<fstream>
#include<iostream>
using namespace std;
vector<long int>v[699999];
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int main()
{
long int i,N,instructiune,numar,cheia;
f>>N;
for(i=1;i<=N;i++)
{
f>>instructiune;
f>>numar;
cheia=numar%699967;
switch(instructiune)
{
case 1:
v[cheia].push_back(numar);
break;
case 2:
{
long int j,lungime=v[cheia].size();
for(j=0;j<lungime;j++)
if(v[cheia][j]==numar)
break;
if(j<lungime)
{
v[cheia][j]=v[cheia][lungime-1];
v[cheia].pop_back();
}
break;
}
case 3:
{
long int j,lungime=v[cheia].size();
for(j=0;j<lungime;j++)
if(v[cheia][j]==numar)
break;
if(j==lungime)
g<<0<<endl;
else
g<<1<<endl;
break;
}
}
}
f.close();
g.close();
return 0;
}