Pagini recente » Cod sursa (job #2594773) | Cod sursa (job #2899772) | Cod sursa (job #1230229) | Cod sursa (job #3005678) | Cod sursa (job #2291385)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int> H[666013];
int p;
int cautare(int x){
int p=x%666013;
int i;
for(i=0;i<H[p].size();i++)
if(H[p][i]==x)
return 1;
return 0;
}
void inserare(int x){
if(cautare(x))
return;
p=x%666013;
H[p].push_back(x);
}
void stergere(int x){
if(!cautare(x))
return;
p=x%666013;
vector<int>::iterator i=H[p].begin();
while(i!=H[p].end()&&*i!=x)
i++;
H[p].erase(i);
}
int main()
{
int n,i,x,c;
f>>n;
for(i=1;i<=n;i++)
{
f>>c>>x;
if(c==1)
inserare(x);
else if(c==2)
stergere(x);
else
g<<cautare(x)<<"\n";
}
return 0;
}