//Patryk Kisielewski - pal.cpp #include <iostream> #include <cstdio> #define MAX 200000 using namespace std; int main(){ int n; string str; char c; cin >> n; if(n > MAX){ int a = 0; int i; unsigned short *tab = new unsigned short[MAX/2]; for(i = 0; i < MAX/2; ++i) tab[i] = 0; getchar(); for(i = 0; i < n/2; ++i){ c = getchar()-'a'; tab[a] += c; a += 3; if(a >= MAX/2) a -= MAX/2; } if(n%2){ getchar(); i++; } for(;i<n; ++i){ c = getchar()-'a'; tab[a] -= c; a -= 3; if(a < 0) a += MAX/2; } for(i = 0; i < MAX/2; ++i){ if(tab[i] != 0){ cout << "NIE\n"; return 0; } } cout << "TAK\n"; return 0; } else if(n == 0){ int a = 0, b = MAX/4-1; int i; unsigned short *tab1 = new unsigned short[MAX/4]; unsigned short *tab2 = new unsigned short[MAX/4]; for(i = 0; i < MAX/4; ++i){ tab1[i] = 0; tab2[i] = 0; } getchar(); while((c = getchar()) != '\n' && c != EOF){ c -= 'a'; tab1[a] += c; tab2[b] += c; a += 3; b -= 3; if(a >= MAX/4) a -= MAX/4; if(b < 0) b += MAX/4; } bool war; for(int i = 0; i < MAX/4; ++i){ war = true; for(int j = 0; j < MAX/4; ++j){ if(tab1[j] != tab2[(i+j)%(MAX/4)]){ war = false; break; } } if(war){ cout << "TAK\n"; return 0; } } cout << "NIE\n"; return 0; } str.resize(200200); cin >> str; for(int i = 0, j = str.size()-1; i < j; ++i, --j){ if(str[i] != str[j]){ cout << "NIE\n"; return 0; } } cout << "TAK\n"; return 0; }
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 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 | //Patryk Kisielewski - pal.cpp #include <iostream> #include <cstdio> #define MAX 200000 using namespace std; int main(){ int n; string str; char c; cin >> n; if(n > MAX){ int a = 0; int i; unsigned short *tab = new unsigned short[MAX/2]; for(i = 0; i < MAX/2; ++i) tab[i] = 0; getchar(); for(i = 0; i < n/2; ++i){ c = getchar()-'a'; tab[a] += c; a += 3; if(a >= MAX/2) a -= MAX/2; } if(n%2){ getchar(); i++; } for(;i<n; ++i){ c = getchar()-'a'; tab[a] -= c; a -= 3; if(a < 0) a += MAX/2; } for(i = 0; i < MAX/2; ++i){ if(tab[i] != 0){ cout << "NIE\n"; return 0; } } cout << "TAK\n"; return 0; } else if(n == 0){ int a = 0, b = MAX/4-1; int i; unsigned short *tab1 = new unsigned short[MAX/4]; unsigned short *tab2 = new unsigned short[MAX/4]; for(i = 0; i < MAX/4; ++i){ tab1[i] = 0; tab2[i] = 0; } getchar(); while((c = getchar()) != '\n' && c != EOF){ c -= 'a'; tab1[a] += c; tab2[b] += c; a += 3; b -= 3; if(a >= MAX/4) a -= MAX/4; if(b < 0) b += MAX/4; } bool war; for(int i = 0; i < MAX/4; ++i){ war = true; for(int j = 0; j < MAX/4; ++j){ if(tab1[j] != tab2[(i+j)%(MAX/4)]){ war = false; break; } } if(war){ cout << "TAK\n"; return 0; } } cout << "NIE\n"; return 0; } str.resize(200200); cin >> str; for(int i = 0, j = str.size()-1; i < j; ++i, --j){ if(str[i] != str[j]){ cout << "NIE\n"; return 0; } } cout << "TAK\n"; return 0; } |