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
#include <iostream>
#include <cmath>

using namespace std;
int x;
char znak;
long long m = 1000000007,hash1,hash2;
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> x;	
	if(x % 2 == 0){
		for(int i = 0; i < x / 2; i++){
			cin >> znak;
			hash1 += (long long)((znak % 96) * pow(31,i)) % 1000000007;
		}
		for(int i = x / 2 - 1; i >= 0; i--){
			cin >> znak;
			hash2 += (long long)((znak % 96) * pow(31,i)) % 1000000007;
		}
	}
	else{
		for(int i = 0; i < x / 2; i++){
			cin >> znak;
			hash1 += (long long)((znak % 96) * pow(31,i)) % 1000000007;
		}
		cin >> znak;
		for(int i = x / 2 - 1; i >= 0; i--){
			cin >> znak;
			hash2 += (long long)((znak % 96) * pow(31,i)) % 1000000007;
		}
		
		
		
	}
	if(hash1 == hash2)
		cout << "TAK";
	else
		cout << "NIE";
	return 0;
}