#include <bits/stdc++.h> using namespace std; struct dane { int p=0,n=0; }*a,*b; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; string a1,b1; cin>>n>>a1>>b1; a=new dane[123]; b=new dane[123]; for(int i=1;i<=n;i++) { if(i%2==0) { a[(int)a1[i-1]].p++; b[(int)b1[i-1]].p++; } else { a[(int)a1[i-1]].n++; b[(int)b1[i-1]].n++; } } bool ok=0; for(int i=97;i<=122;i++) { if(a[i].p==b[i].p && a[i].n==b[i].n) ok=0; else { ok=1; break; } } if(ok==0) 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 39 40 41 42 43 44 45 46 47 48 49 50 51 52 | #include <bits/stdc++.h> using namespace std; struct dane { int p=0,n=0; }*a,*b; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; string a1,b1; cin>>n>>a1>>b1; a=new dane[123]; b=new dane[123]; for(int i=1;i<=n;i++) { if(i%2==0) { a[(int)a1[i-1]].p++; b[(int)b1[i-1]].p++; } else { a[(int)a1[i-1]].n++; b[(int)b1[i-1]].n++; } } bool ok=0; for(int i=97;i<=122;i++) { if(a[i].p==b[i].p && a[i].n==b[i].n) ok=0; else { ok=1; break; } } if(ok==0) cout<<"TAK"; else cout<<"NIE"; return 0; } |