#include <cstdio> using namespace std; #define MAX_N 300010 int N; char Z[MAX_N]; int c[26][2]; int main() { scanf("%d", &N); scanf("%s", Z); for (int i = 0; i < N; ++i) { c[Z[i] - 'a'][i % 2]++; } scanf("%s", Z); for (int i = 0; i < N; ++i) { c[Z[i] - 'a'][i % 2]--; } for (int i = 0; i < 26; ++i) { if (c[i][0] != 0 || c[i][1] != 0) { N = 0; break; } } printf("%s\n", N ? "TAK" : "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 | #include <cstdio> using namespace std; #define MAX_N 300010 int N; char Z[MAX_N]; int c[26][2]; int main() { scanf("%d", &N); scanf("%s", Z); for (int i = 0; i < N; ++i) { c[Z[i] - 'a'][i % 2]++; } scanf("%s", Z); for (int i = 0; i < N; ++i) { c[Z[i] - 'a'][i % 2]--; } for (int i = 0; i < 26; ++i) { if (c[i][0] != 0 || c[i][1] != 0) { N = 0; break; } } printf("%s\n", N ? "TAK" : "NIE"); return 0; } |