Pagini recente » Cod sursa (job #2315881) | Cod sursa (job #67531) | Cod sursa (job #1162947) | Cod sursa (job #676305) | Cod sursa (job #2374142)
#include<fstream>
#include<vector>
#define MOD 666031
using namespace std;
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
int n,val,test;
vector<int> G[MOD+5];
int cheie(int x){
return x%MOD;
}
int gaseste(int x){
int y=cheie(x);
for(int i=0;i<G[y].size();++i)
if(G[y][i]==x) return 1;
return 0;
}
void adauga(int x){
int y=cheie(x);
G[y].push_back(x);
return ;
}
void sterge(int x){
int y=cheie(x);
for(int i=0;i<G[y].size();++i)
if(G[y][i]==x){
G[y].erase(G[y].begin()+i,G[y].begin()+i+1);
return;
}
return;
}
int main()
{
f>>n;
for(int i=1;i<=n;++i){
f>>test>>val;
if(test==1){
adauga(val);
}
if(test==2){
sterge(val);
}
if(test==3){
g<<gaseste(val)<<'\n';
}
}
}