#include <bits/stdc++.h> #define pb push_back #define f first #define s second #define all(x) x.begin(), x.end() using namespace std; typedef long long ll; typedef pair<int,int> pii; int ile[30][2]; int main(){ std::ios::sync_with_stdio(false); cout.tie(0); cin.tie(0); int n; cin >> n; string a, b; cin >> a >> b; for (int i = 0; i < n; i ++) { ile[a[i] - 'a'][i & 1] ++; } for (int i = 0; i < n; i ++) { if (!ile[b[i] - 'a'][i & 1]) { cout << "NIE\n"; return 0; } ile[b[i] - 'a'][i & 1] --; } 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 | #include <bits/stdc++.h> #define pb push_back #define f first #define s second #define all(x) x.begin(), x.end() using namespace std; typedef long long ll; typedef pair<int,int> pii; int ile[30][2]; int main(){ std::ios::sync_with_stdio(false); cout.tie(0); cin.tie(0); int n; cin >> n; string a, b; cin >> a >> b; for (int i = 0; i < n; i ++) { ile[a[i] - 'a'][i & 1] ++; } for (int i = 0; i < n; i ++) { if (!ile[b[i] - 'a'][i & 1]) { cout << "NIE\n"; return 0; } ile[b[i] - 'a'][i & 1] --; } cout << "TAK\n"; return 0; } |