#include<iostream> #include<set> using namespace std; int main() { int n; cin>>n; multiset<pair<char,int> > IN,OUT; string x; cin>>x; for(int i=0 ; i<x.length() ; i++) { IN.insert({x[i],i%2}); } cin>>x; for(int i=0 ; i<x.length() ; i++) { OUT.insert({x[i],i%2}); } multiset<pair<char,int> >::iterator p=IN.begin(); multiset<pair<char,int> >::iterator q=OUT.begin(); while(p!=IN.end()) { if(*p!=*q || (*p).second!=(*q).second) { cout<<"NIE"<<endl; return 0; } p++; q++; } cout<<"TAK"<<endl; 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 | #include<iostream> #include<set> using namespace std; int main() { int n; cin>>n; multiset<pair<char,int> > IN,OUT; string x; cin>>x; for(int i=0 ; i<x.length() ; i++) { IN.insert({x[i],i%2}); } cin>>x; for(int i=0 ; i<x.length() ; i++) { OUT.insert({x[i],i%2}); } multiset<pair<char,int> >::iterator p=IN.begin(); multiset<pair<char,int> >::iterator q=OUT.begin(); while(p!=IN.end()) { if(*p!=*q || (*p).second!=(*q).second) { cout<<"NIE"<<endl; return 0; } p++; q++; } cout<<"TAK"<<endl; return 0; } |