#include <bits/stdc++.h> using namespace std; #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define ll long long int mod=1000000007; int inf=1000000007; ll infl=1000000000000000007; int ile1[2][26],ile2[2][26]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; string a,b; cin>>a>>b; for(int i=0;i<n;i++) ile1[i%2][a[i]-'a']++; for(int i=0;i<n;i++) ile2[i%2][b[i]-'a']++; bool ok=1; for(int i=0;i<26;i++) { if(ile1[0][i]!=ile2[0][i]||ile1[1][i]!=ile2[1][i]) ok=0; } if(!ok) cout<<"NIE"; else cout<<"TAK"; 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> using namespace std; #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define ll long long int mod=1000000007; int inf=1000000007; ll infl=1000000000000000007; int ile1[2][26],ile2[2][26]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; string a,b; cin>>a>>b; for(int i=0;i<n;i++) ile1[i%2][a[i]-'a']++; for(int i=0;i<n;i++) ile2[i%2][b[i]-'a']++; bool ok=1; for(int i=0;i<26;i++) { if(ile1[0][i]!=ile2[0][i]||ile1[1][i]!=ile2[1][i]) ok=0; } if(!ok) cout<<"NIE"; else cout<<"TAK"; return 0; } |