Pagini recente » Cod sursa (job #1532529) | Cod sursa (job #397041) | Cod sursa (job #1892641) | Cod sursa (job #2414941) | Cod sursa (job #1047933)
#include <vector>
#include<fstream>
using namespace std;
#define max 666013
vector<int> wc[max];
int find(int val)
{
int zona=val/max;
for(int it=0; it<wc[zona].size(); it++)
if(wc[zona][it]==val)
return 1;
return 0;
}
void delet(int val)
{
int zona=val/max;
for(int i=0; i<wc[zona].size(); i++)
{
if(wc[zona][i]==val)
{
wc[zona][i]=wc[zona].back();
wc[zona].pop_back();
break;
}
}
}
void inserare(int val)
{
int zona=val/max;
if(find(val)==0)
{
wc[zona].push_back(val);
}
}
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,i,x,y;
f>>n;
for(i=1; i<=n; i++)
{
f>>x>>y;
if(x==1)
inserare(y);
else
if(x==2)
delet(y);
else
{
g<<find(y)<<endl;
}
}
return 0;
}