Pagini recente » Cod sursa (job #337318) | Cod sursa (job #2641133) | Cod sursa (job #423028) | Cod sursa (job #403877) | Cod sursa (job #2293772)
#include <fstream>
#include <list>
#define p 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
list<int> H[p];
int main()
{
int t, x, n, mP, sem;
list<int>::iterator it;
fin >> n;
for(int i = 1; i <= n; i++){
fin >> t >> x; mP = x % p;
if(t == 1){sem = 0;
for(it = H[mP].begin(); it != H[mP].end(); it++)
if(*it == x){ sem = 1; break;}
if(sem == 0) H[mP].push_back(x);
} else if(t == 2){
H[mP].remove(x);
} else if(t == 3){
sem = 0;
for(it = H[mP].begin(); it != H[mP].end(); it++)
if(*it == x){ sem = 1; break;}
fout << sem << "\n";
}
}
return 0;
}