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
45
46
47
48
49
50
51
52
53
54
55
#include <cstdio>
#include <vector>
#include <bitset>

using namespace std;

const int N = 50000;

int main() { 
    int n, m, q;
    scanf("%d%d%d", &n, &m, &q);
    vector<bitset<N>> bs;
    bs.resize(n + m);
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j += (i + 1)) {
            bs[i][j] = true;
        }
    }

    for (int i = 0; i < m; i++) {
        int op;
        scanf("%d", &op);
        if (op == 1) {
            int x, y;
            scanf("%d%d", &x, &y);
            x--; y--;
            bs[i + n] = bs[x] | bs[y];
        } else if (op == 2) {
            int x, y;
            scanf("%d%d", &x, &y);
            x--; y--;
            bs[i + n] = bs[x] & bs[y];
        } else {
            int x;
            scanf("%d", &x);
            x--;
            bs[i + n] = ~bs[x];
        }
    }

    for (int i = 0; i < q; i++) {
        int x, v;
        scanf("%d%d", &x, &v);
        x--; v--;
        if (bs[x][v]) {
            printf("TAK\n");
        } else {
            printf("NIE\n");
        }
    }

}


// g++ -std=c++17 -Wall -Wextra -Wshadow zb1.cpp -o zb1