#include <bits/stdc++.h> using namespace std; using LL = long long int; using uLL = unsigned long long int; using uint = unsigned int; using ld = long double; int main(){ cin.tie(NULL); ios_base::sync_with_stdio(0); int n; cin >> n; string a, b; cin >> a >> b; string an, bn; an.resize((n+1)/2); bn.resize((n+1)/2); for(int i = 0; i < n; i += 2){ an[i/2] = a[i]; bn[i/2] = b[i]; } sort(a.begin(), a.end()); sort(b.begin(), b.end()); sort(an.begin(), an.end()); sort(bn.begin(), bn.end()); if(a == b && an == bn){ 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 | #include <bits/stdc++.h> using namespace std; using LL = long long int; using uLL = unsigned long long int; using uint = unsigned int; using ld = long double; int main(){ cin.tie(NULL); ios_base::sync_with_stdio(0); int n; cin >> n; string a, b; cin >> a >> b; string an, bn; an.resize((n+1)/2); bn.resize((n+1)/2); for(int i = 0; i < n; i += 2){ an[i/2] = a[i]; bn[i/2] = b[i]; } sort(a.begin(), a.end()); sort(b.begin(), b.end()); sort(an.begin(), an.end()); sort(bn.begin(), bn.end()); if(a == b && an == bn){ cout << "TAK\n"; } else{ cout << "NIE\n"; } return 0; } |