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
56
57
58
59
60
61
62
63
64
#include<bits/stdc++.h>

const int M = 100001;
int typ[M];
int a[M];
int b[M];

std::bitset<50001> bs[M];

int main(){
	using namespace std;
	ios::sync_with_stdio(false), cin.tie(nullptr);
	
	int n, m, q;
	cin >> n >> m >> q;
	
	for(int i = 1;i <= n;i++){
		for(int j = i;j <= n;j += i){
			bs[i][j] = 1;
		}
	}
	
	for(int i = 1;i <= m;i++){
		// mamy zbiór n + i
		int op;
		cin >> op;
		typ[n + i] = op;
		switch (op) {
			case 1: // suma 
				{
					int x, y;
					cin >> x >> y;
					a[n + i] = x;
					b[n + i] = y;
					bs[n + i] = bs[x] | bs[y];
				}
				break;
			case 2: // przecięcie
				{
					int x, y;
					cin >> x >> y;
					a[n + i] = x;
					b[n + i] = y;
					bs[n + i] = bs[x] & bs[y];
				}
				break;
			default: // negacja
				{
					int x;
					cin >> x;
					a[n + i] = x;
					bs[n + i] = ~bs[x];
				}
		}
	}
		
	while(q--){
		int x, v;
		cin >> x >> v;
		cout << (bs[x][v] ? "TAK" : "NIE") << '\n';
	}
	
	return 0;
}