#include <iostream> using namespace std; int letters[50]; char tab[2000010]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; if(n>0){ if (n<=2000010){ for(int i = 0; i<n; i++){ cin >> tab[i]; } int a = 0; int b = (n-1); bool pal = true; while(a<b){ if(tab[a]!=tab[b]){ pal=false; break; } a++; b--; } if(pal){ cout << "TAK"; } else{ cout << "NIE"; } return 0; } else{ int let=97; int beg,end; if(n%2==0){ beg=n/2-1000000; end=n/2+999999; } else{ beg = n/2-1000000; end = n/2+1000000; } int j = 0; char pocz[2000]; int p =1000; for(int i = 0; i<n; i++){ char a; cin >> a; letters[a-let]++; if (i>=beg&&i<=end){ tab[j]=a; j++; } if(i<1000){ pocz[i]=a; } if(i>=n-1000){ pocz[p]=a; p++; } } int a = 0; int b = 1999999; bool pal = true; while(a<b){ if(tab[a]!=tab[b]){ pal=false; break; } a++; b--; } a = 0; b = 1999; while(a<b){ if(pocz[a]!=pocz[b]){ pal=false; break; } a++; b--; } int niep = 0; for(int i = 0; i<26; i++){ if(letters[i]%2==1){ niep++; } } if(n%2==0){ if(niep){ pal = false; } } else{ if (niep>1){ pal = false; } } if(pal){ cout << "TAK"; } else{ cout << "NIE"; } } } else{ char a; int let = 97; int n = 0; while(cin >> a){ n++; letters[a-let]++; } bool pal = true; int niep = 0; for(int i = 0; i<26; i++){ if(letters[i]%2==1){ niep++; } } if(n%2==0){ if(niep){ pal = false; } } else{ if (niep>1){ pal = false; } } if(pal){ cout << "TAK"; } else{ cout << "NIE"; } } 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 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 | #include <iostream> using namespace std; int letters[50]; char tab[2000010]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; if(n>0){ if (n<=2000010){ for(int i = 0; i<n; i++){ cin >> tab[i]; } int a = 0; int b = (n-1); bool pal = true; while(a<b){ if(tab[a]!=tab[b]){ pal=false; break; } a++; b--; } if(pal){ cout << "TAK"; } else{ cout << "NIE"; } return 0; } else{ int let=97; int beg,end; if(n%2==0){ beg=n/2-1000000; end=n/2+999999; } else{ beg = n/2-1000000; end = n/2+1000000; } int j = 0; char pocz[2000]; int p =1000; for(int i = 0; i<n; i++){ char a; cin >> a; letters[a-let]++; if (i>=beg&&i<=end){ tab[j]=a; j++; } if(i<1000){ pocz[i]=a; } if(i>=n-1000){ pocz[p]=a; p++; } } int a = 0; int b = 1999999; bool pal = true; while(a<b){ if(tab[a]!=tab[b]){ pal=false; break; } a++; b--; } a = 0; b = 1999; while(a<b){ if(pocz[a]!=pocz[b]){ pal=false; break; } a++; b--; } int niep = 0; for(int i = 0; i<26; i++){ if(letters[i]%2==1){ niep++; } } if(n%2==0){ if(niep){ pal = false; } } else{ if (niep>1){ pal = false; } } if(pal){ cout << "TAK"; } else{ cout << "NIE"; } } } else{ char a; int let = 97; int n = 0; while(cin >> a){ n++; letters[a-let]++; } bool pal = true; int niep = 0; for(int i = 0; i<26; i++){ if(letters[i]%2==1){ niep++; } } if(n%2==0){ if(niep){ pal = false; } } else{ if (niep>1){ pal = false; } } if(pal){ cout << "TAK"; } else{ cout << "NIE"; } } return 0; } |