#include<bits/stdc++.h> #define FOR(i,be,en) for(int i=be; i<en; i++) using namespace std; const int MAXN=3e5+5; int Bi[2][26]; int Ba[2][26]; bool Possible(){ FOR(i,0,2){ FOR(j,0,26){ if(Bi[i][j]!=Ba[i][j]) return false; } } return true; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; string a,b; cin>>n>>a>>b; FOR(i,0,n){ Bi[(i&1)][a[i]-'a']++; Ba[(i&1)][b[i]-'a']++; } if(Possible()) 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 35 36 37 38 | #include<bits/stdc++.h> #define FOR(i,be,en) for(int i=be; i<en; i++) using namespace std; const int MAXN=3e5+5; int Bi[2][26]; int Ba[2][26]; bool Possible(){ FOR(i,0,2){ FOR(j,0,26){ if(Bi[i][j]!=Ba[i][j]) return false; } } return true; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; string a,b; cin>>n>>a>>b; FOR(i,0,n){ Bi[(i&1)][a[i]-'a']++; Ba[(i&1)][b[i]-'a']++; } if(Possible()) cout<<"TAK"; else cout<<"NIE"; return 0; } |