#include <bits/stdc++.h> using namespace std; typedef long long LL; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string s[2]; int k[2][2][32] = {}; for (int i = 0; i < 2; ++i) { cin >> s[i]; int si = s[i].size(); for (int j = 0; j < si; ++j) { int d = s[i][j] - 'a'; k[i][j % 2][d]++; } } for (int i = 0; i < 2; ++i) { for (int j = 0; j < 32; ++j) { if (k[0][i][j] != k[1][i][j]) { cout << "NIE" << endl; return 0; } } } cout << "TAK" << endl; }
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 | #include <bits/stdc++.h> using namespace std; typedef long long LL; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string s[2]; int k[2][2][32] = {}; for (int i = 0; i < 2; ++i) { cin >> s[i]; int si = s[i].size(); for (int j = 0; j < si; ++j) { int d = s[i][j] - 'a'; k[i][j % 2][d]++; } } for (int i = 0; i < 2; ++i) { for (int j = 0; j < 32; ++j) { if (k[0][i][j] != k[1][i][j]) { cout << "NIE" << endl; return 0; } } } cout << "TAK" << endl; } |