#include <bits/stdc++.h> using namespace std; int main() { int n; string s[2]; cin >> n >> s[0] >> s[1]; string d[2][2]; for (int i = 0; i < 2; i++) { for (int j = 0; j < n; j++) { d[i][j%2].push_back(s[i][j]); } } for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { sort(d[i][j].begin(), d[i][j].end()); } } bool good = (d[0][0] == d[1][0] && d[0][1] == d[1][1]); cout << (good ? "TAK" : "NIE"); 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 | #include <bits/stdc++.h> using namespace std; int main() { int n; string s[2]; cin >> n >> s[0] >> s[1]; string d[2][2]; for (int i = 0; i < 2; i++) { for (int j = 0; j < n; j++) { d[i][j%2].push_back(s[i][j]); } } for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { sort(d[i][j].begin(), d[i][j].end()); } } bool good = (d[0][0] == d[1][0] && d[0][1] == d[1][1]); cout << (good ? "TAK" : "NIE"); return 0; } |