Pagini recente » Cod sursa (job #639517) | Cod sursa (job #3247288) | Cod sursa (job #1826248) | Cod sursa (job #1366296) | Cod sursa (job #1332592)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> T[666013];
int m=666013,i,op,e,n;
int exis(int e)
{
int i;
for(i=0;i<T[e%m].size();i++)
if(T[e%m][i]==e)
return false;
return true;
}
void ins(int e)
{
if(exis(e))
T[e%m].push_back(e);
}
void sterg(int e)
{
int i;
for(i=0;i<T[e%m].size();i++)
if(T[e%m][i]==e)
{
T[e%m][i]=T[e%m].back();
T[e%m].pop_back();
return;
}
}
int caut(int e)
{
int i;
for(i=0;i<T[e%m].size();i++)
if(T[e%m][i]==e)
return 1;
return 0;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>op>>e;
if(op==1)
ins(e);
else if(op==2)
sterg(e);
else
g<<caut(e)<<endl;
}
return 0;
}