#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie();
int n, m, q;
cin >> n >> m >> q;
vector<bitset<50005>> fb(n + m + 1);
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j += i) {
fb[i][j] = 1;
}
}
for (int i = 1; i <= m; i++) {
int c, a, b;
cin >> c >> a;
if (c == 1) {
cin >> b;
fb[i + n] = fb[a] | fb[b];
} else if (c == 2) {
cin >> b;
fb[i + n] = fb[a] & fb[b];
} else {
fb[i + n] = ~fb[a];
}
}
// for (int i = 1; i <= n + m; i++) {
// cout << i << ": ";
// dump(fb[i].s[0]);
// }
for (int i = 0; i < q; i++) {
int x, v;
cin >> x >> v;
cout << (fb[x][v] ? "TAK" : "NIE") << "\n";
}
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(); int n, m, q; cin >> n >> m >> q; vector<bitset<50005>> fb(n + m + 1); for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j += i) { fb[i][j] = 1; } } for (int i = 1; i <= m; i++) { int c, a, b; cin >> c >> a; if (c == 1) { cin >> b; fb[i + n] = fb[a] | fb[b]; } else if (c == 2) { cin >> b; fb[i + n] = fb[a] & fb[b]; } else { fb[i + n] = ~fb[a]; } } // for (int i = 1; i <= n + m; i++) { // cout << i << ": "; // dump(fb[i].s[0]); // } for (int i = 0; i < q; i++) { int x, v; cin >> x >> v; cout << (fb[x][v] ? "TAK" : "NIE") << "\n"; } } |
English