#include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> using namespace std; int main(){ string a, b; int n; cin >> n; bool possible = true; cin >> a; cin >> b; std::map<char, int> counts_even; std::map<char, int> counts_odd; for(int i = 0; i < a.size(); i ++){ if(i % 2) { counts_even[a[i]] ++; } else { counts_odd[a[i]] ++; } } for(int i = 0; i < b.size(); i ++){ if(i % 2) { counts_even[b[i]] --; } else { counts_odd[b[i]] --; } } for(auto a : counts_even){ if(a.second != 0){ possible = false; } } for(auto a : counts_odd){ if(a.second != 0){ possible = false; } } if(possible){ cout << "TAK"; } else { cout << "NIE"; } cout << endl; }
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 46 47 48 49 50 51 52 53 54 55 | #include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> using namespace std; int main(){ string a, b; int n; cin >> n; bool possible = true; cin >> a; cin >> b; std::map<char, int> counts_even; std::map<char, int> counts_odd; for(int i = 0; i < a.size(); i ++){ if(i % 2) { counts_even[a[i]] ++; } else { counts_odd[a[i]] ++; } } for(int i = 0; i < b.size(); i ++){ if(i % 2) { counts_even[b[i]] --; } else { counts_odd[b[i]] --; } } for(auto a : counts_even){ if(a.second != 0){ possible = false; } } for(auto a : counts_odd){ if(a.second != 0){ possible = false; } } if(possible){ cout << "TAK"; } else { cout << "NIE"; } cout << endl; } |