#include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin>>n; int parz1 [26] = {0}; int nieparz1 [26] = {0}; int parz2 [26] = {0}; int nieparz2 [26] = {0}; char x; for(int i=0; i<n; i++){ cin>>x; if(i%2==0){ parz1[x-'a']++; } else{ nieparz1[x-'a']++; } } for(int i=0; i<n; i++){ cin>>x; if(i%2==0){ parz2[x-'a']++; } else{ nieparz2[x-'a']++; } } for(int i=0; i<26; i++){ if(parz1[i]!=parz2[i]||nieparz1[i]!=nieparz2[i]){ cout<<"NIE"; return 0; } } cout<<"TAK"; }
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; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin>>n; int parz1 [26] = {0}; int nieparz1 [26] = {0}; int parz2 [26] = {0}; int nieparz2 [26] = {0}; char x; for(int i=0; i<n; i++){ cin>>x; if(i%2==0){ parz1[x-'a']++; } else{ nieparz1[x-'a']++; } } for(int i=0; i<n; i++){ cin>>x; if(i%2==0){ parz2[x-'a']++; } else{ nieparz2[x-'a']++; } } for(int i=0; i<26; i++){ if(parz1[i]!=parz2[i]||nieparz1[i]!=nieparz2[i]){ cout<<"NIE"; return 0; } } cout<<"TAK"; } |