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