#include<cstdio> const int SIZE = 300*1001; char bi[SIZE]; char ba[SIZE]; int cnt[26][2]; bool chck() { for (int i = 0; i < 26; ++i) { for (int j = 0; j < 2; ++j) { if (cnt[i][j] != 0) return false; } } return true; } int main() { int n; scanf("%i", &n); scanf("%s", bi); scanf("%s", ba); //printf("%s\n", bi); //printf("%s\n", ba); for (int i = 0; i < 26; ++i) for (int j = 0; j < 2; ++j) cnt[i][j] = 0; for (int i = 0; i < n; ++i) { cnt[bi[i] - 'a'][i%2]++; cnt[ba[i] - 'a'][i%2]--; } if (chck()) { printf("TAK\n"); } else { printf("NIE\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 | #include<cstdio> const int SIZE = 300*1001; char bi[SIZE]; char ba[SIZE]; int cnt[26][2]; bool chck() { for (int i = 0; i < 26; ++i) { for (int j = 0; j < 2; ++j) { if (cnt[i][j] != 0) return false; } } return true; } int main() { int n; scanf("%i", &n); scanf("%s", bi); scanf("%s", ba); //printf("%s\n", bi); //printf("%s\n", ba); for (int i = 0; i < 26; ++i) for (int j = 0; j < 2; ++j) cnt[i][j] = 0; for (int i = 0; i < n; ++i) { cnt[bi[i] - 'a'][i%2]++; cnt[ba[i] - 'a'][i%2]--; } if (chck()) { printf("TAK\n"); } else { printf("NIE\n"); } return 0; } |