Pagini recente » Cod sursa (job #796859) | Cod sursa (job #2298250) | Cod sursa (job #1196509) | Cod sursa (job #2448443) | Cod sursa (job #1188836)
#include<fstream>
#include<vector>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
const int MOD = 660013;
vector<int> v[MOD];
int este_in_multime(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(!este_in_multime(n));
v[(n%MOD)].push_back(n);
}
void del(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 T;
in>>T;
int i,j;
for( ; T ; --T)
{
in>>i;
if(i == 1){
in>>j;
adauga(j);
continue;
}
if(i == 2){
in>>j;
del(j);
continue;
}
if(i == 3)
{
in>>j;
out<<este_in_multime(j)<<"\n";
}
}
return 0;
}