Pagini recente » Cod sursa (job #2433137) | Cod sursa (job #984493) | Cod sursa (job #682421) | Cod sursa (job #768824) | Cod sursa (job #2074016)
#include <fstream>
#include <map>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
const int p = 666013;
map <int, int>dict[p + 2];
int n, q, x;
int main(){
in >> n;
while (n > 0){
in >> q >> x;
if (q == 1){
dict[x % p][x] = 1;
}
if (q == 2){
if (dict[x % p].count(x))
dict[x % p].erase(x);
}
if (q == 3){
if (dict[x % p].count(x))
out << 1 << '\n';
else
out << 0 << '\n';
}
n --;
}
return 0;
}