#include <bits/stdc++.h> using namespace std; const int q = 30; int main() { std::ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int p1[q], p2[q], n1[q], n2[q]; for(int i = 0; i < q; i ++) { p1[i] = 0; p2[i] = 0; n1[i] = 0; n2[i] = 0; } for(int i = 0; i < n; i ++) { char x; cin >> x; if(i % 2 == 0) p1[int(x) - int('a')] ++; else n1[int(x) - int('a')] ++; } for(int i = 0; i < n; i ++) { char x; cin >> x; if(i % 2 == 0) p2[int(x) - int('a')] ++; else n2[int(x) - int('a')] ++; } bool wynik = true; for(int i = 0; i < q; i ++) { if(p1[i] != p2[i]) wynik = false; if(n1[i] != n2[i]) wynik = false; } if(wynik) cout << "TAK"; else cout << "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 29 30 31 32 33 34 | #include <bits/stdc++.h> using namespace std; const int q = 30; int main() { std::ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int p1[q], p2[q], n1[q], n2[q]; for(int i = 0; i < q; i ++) { p1[i] = 0; p2[i] = 0; n1[i] = 0; n2[i] = 0; } for(int i = 0; i < n; i ++) { char x; cin >> x; if(i % 2 == 0) p1[int(x) - int('a')] ++; else n1[int(x) - int('a')] ++; } for(int i = 0; i < n; i ++) { char x; cin >> x; if(i % 2 == 0) p2[int(x) - int('a')] ++; else n2[int(x) - int('a')] ++; } bool wynik = true; for(int i = 0; i < q; i ++) { if(p1[i] != p2[i]) wynik = false; if(n1[i] != n2[i]) wynik = false; } if(wynik) cout << "TAK"; else cout << "NIE"; return 0; } |