#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string s, t; cin >> s >> t; string s0, s1; string t0, t1; for (int i = 0; i < n; i++) { if (i % 2 == 0) { s0.push_back(s[i]); t0.push_back(t[i]); } else { s1.push_back(s[i]); t1.push_back(t[i]); } } sort(s0.begin(), s0.end()); sort(s1.begin(), s1.end()); sort(t0.begin(), t0.end()); sort(t1.begin(), t1.end()); if (s0 == t0 && s1 == t1) { cout << "TAK\n"; } else { cout << "NIE\n"; } } int main() { ios_base::sync_with_stdio(false); cout.precision(15); cout << fixed; cin.tie(0); int T = 1; //cin >> T; for (int tst = 0; tst < T; tst++) { solve(); } 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 43 44 45 | #include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string s, t; cin >> s >> t; string s0, s1; string t0, t1; for (int i = 0; i < n; i++) { if (i % 2 == 0) { s0.push_back(s[i]); t0.push_back(t[i]); } else { s1.push_back(s[i]); t1.push_back(t[i]); } } sort(s0.begin(), s0.end()); sort(s1.begin(), s1.end()); sort(t0.begin(), t0.end()); sort(t1.begin(), t1.end()); if (s0 == t0 && s1 == t1) { cout << "TAK\n"; } else { cout << "NIE\n"; } } int main() { ios_base::sync_with_stdio(false); cout.precision(15); cout << fixed; cin.tie(0); int T = 1; //cin >> T; for (int tst = 0; tst < T; tst++) { solve(); } return 0; } |