#include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; typedef pair<int, int> pii; const int maxn = 300005; int cnt[2][30]; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; string s1, s2; cin >> s1 >> s2; for (int i = 0; i < n; i++) { cnt[i % 2][s1[i] - 'a']++; cnt[i % 2][s2[i] - 'a']--; } bool ans = true; for (int i = 0; i < 26; i++) { if (cnt[0][i] != 0 || cnt[1][i] != 0) ans = false; } if (ans) cout << "TAK\n"; else cout << "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 | #include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; typedef pair<int, int> pii; const int maxn = 300005; int cnt[2][30]; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; string s1, s2; cin >> s1 >> s2; for (int i = 0; i < n; i++) { cnt[i % 2][s1[i] - 'a']++; cnt[i % 2][s2[i] - 'a']--; } bool ans = true; for (int i = 0; i < 26; i++) { if (cnt[0][i] != 0 || cnt[1][i] != 0) ans = false; } if (ans) cout << "TAK\n"; else cout << "NIE\n"; return 0; } |