#include <iostream> #define MAXN 30 using namespace std; struct letters{ int cnt_np; int cnt_p; }; letters t[MAXN]; int main() { ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; string s1; cin >> s1; string s2; cin >> s2; for(int i = 0; i < n; i++){ if(i % 2 == 0) t[s1[i] - 'a'].cnt_p++; else t[s1[i] - 'a'].cnt_np++; } for(int i = 0; i < n; i++){ if(i % 2 == 0){ if(!t[s2[i]-'a'].cnt_p){ cout << "NIE\n"; return 0; } else t[s2[i]-'a'].cnt_p--; } else{ if(!t[s2[i]-'a'].cnt_np){ cout << "NIE\n"; return 0; } else t[s2[i]-'a'].cnt_np--; } } cout << "TAK\n"; }
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 | #include <iostream> #define MAXN 30 using namespace std; struct letters{ int cnt_np; int cnt_p; }; letters t[MAXN]; int main() { ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; string s1; cin >> s1; string s2; cin >> s2; for(int i = 0; i < n; i++){ if(i % 2 == 0) t[s1[i] - 'a'].cnt_p++; else t[s1[i] - 'a'].cnt_np++; } for(int i = 0; i < n; i++){ if(i % 2 == 0){ if(!t[s2[i]-'a'].cnt_p){ cout << "NIE\n"; return 0; } else t[s2[i]-'a'].cnt_p--; } else{ if(!t[s2[i]-'a'].cnt_np){ cout << "NIE\n"; return 0; } else t[s2[i]-'a'].cnt_np--; } } cout << "TAK\n"; } |