Pagini recente » Cod sursa (job #2801526) | Cod sursa (job #847506) | Cod sursa (job #2437374) | Cod sursa (job #2049178) | Cod sursa (job #1322356)
#include<fstream>
#include<vector>
#define MOD 660013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int> v[MOD];
int cauta(int n)
{ int p = n%MOD;
for(int i = 0 ; i < v[p].size() ; i++)
if(v[p][i] == n) return 1;
return 0;
}
void adauga(int n)
{
if(!cauta(n));
v[(n%MOD)].push_back(n);
}
void sterge(int n)
{ int p = n%MOD;
for(int i = 0 ; i < v[p].size() ; i++)
if(v[p][i] == n) v[p].erase(v[p].begin()+i);
}
int main()
{ int n;
int cod,x;
f>>n;
for( int i=1;i<=n;i++)
{ f>>cod;
if(cod == 1){
f>>x;
adauga(x);
continue;
}
if(cod == 2){
f>>x;
sterge(x);
continue;
}
if(cod == 3)
{
f>>x;
g<<cauta(x)<<"\n";
}
}
return 0;
}