#include <bits/stdc++.h> #define qio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define debug(x) cerr<<#x<<" "<<x<<endl #define ll long long #define st first #define nd second using namespace std; int n, t, zn[5][5][30], temp; string s, z; int main() { qio; cin >> n >> s >> z; for (int i = 0; i < n; i++) { zn[1][i % 2][s[i] - 'a']++; zn[2][i % 2][z[i] - 'a']++; } for (int i = 0; i <= 25; i++) { if (zn[1][0][i] != zn[2][0][i]) temp = 1; if (zn[1][1][i] != zn[2][1][i]) temp = 1; } if (temp == 1) cout << "NIE"; else cout << "TAK"; }
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 | #include <bits/stdc++.h> #define qio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define debug(x) cerr<<#x<<" "<<x<<endl #define ll long long #define st first #define nd second using namespace std; int n, t, zn[5][5][30], temp; string s, z; int main() { qio; cin >> n >> s >> z; for (int i = 0; i < n; i++) { zn[1][i % 2][s[i] - 'a']++; zn[2][i % 2][z[i] - 'a']++; } for (int i = 0; i <= 25; i++) { if (zn[1][0][i] != zn[2][0][i]) temp = 1; if (zn[1][1][i] != zn[2][1][i]) temp = 1; } if (temp == 1) cout << "NIE"; else cout << "TAK"; } |