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
#include <cstdio>
using namespace std;

long long power_diff, a_min, a_max, b_min, b_max, l, a, b;

int main()
{
    int t, n;
    scanf("%d", &t);
    while (t--) {
        power_diff = 0;
        scanf("%d", &n);
        scanf("%lld %lld %lld", &l, &a, &b);
        power_diff += l * a - l * b;
        a_min = a_max = a;
        b_min = b_max = b;
        for (int i = 1; i < n; ++i) {
            scanf("%lld %lld %lld", &l, &a, &b);
            power_diff += l * a - l * b;
            if (a < a_min)
                a_min = a;
            else if (a > a_max)
                a_max = a;
            if (b < b_min)
                b_min = b;
            else if (b > b_max)
                b_max = b;
        }
        if (power_diff == 0 && a_min <= b_min && b_max <= a_max)
            printf("TAK\n");
        else
            printf("NIE\n");
    }
}