Cod sursa(job #2588579)
| Utilizator | Data | 24 martie 2020 23:15:03 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
set <int> G[MOD];
int main () {
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
ios::sync_with_stdio(false);
int n, key, x;
fin >> n;
for (; n; n--) {
fin >> key >> x;
switch (key) {
case 1:
G[x%MOD].insert(x);
break;
case 2:
G[x%MOD].erase(x);
break;
case 3:
fout << (G[x%MOD].find(x) != G[x%MOD].end()) << '\n';
break;
}
}
return 0;
}
