#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
cin>>n;
string wyr_1,wyr_2;
cin>>wyr_1>>wyr_2;
vector<pair<int,int>> tab_1(26,make_pair(0,0));
vector<pair<int,int>> tab_2(26,make_pair(0,0));
for(int i=0;i<n;i++)
{
int x=wyr_1[i]-97;
int y=wyr_2[i]-97;
if(i%2==0)
{
tab_1[x].first++;
tab_2[y].first++;
}
else
{
tab_1[x].second++;
tab_2[y].second++;
}
}
int counter=0;
for(int i=0;i<26;i++)
{
if(tab_1[i].first==tab_2[i].first)
{
counter++;
}
if(tab_1[i].second==tab_2[i].second)
{
counter++;
}
}
if(counter==52)
{
cout<<"TAK"<<endl;
}
else
{
cout<<"NIE"<<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 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 | #include<iostream> #include<vector> using namespace std; int main() { int n; cin>>n; string wyr_1,wyr_2; cin>>wyr_1>>wyr_2; vector<pair<int,int>> tab_1(26,make_pair(0,0)); vector<pair<int,int>> tab_2(26,make_pair(0,0)); for(int i=0;i<n;i++) { int x=wyr_1[i]-97; int y=wyr_2[i]-97; if(i%2==0) { tab_1[x].first++; tab_2[y].first++; } else { tab_1[x].second++; tab_2[y].second++; } } int counter=0; for(int i=0;i<26;i++) { if(tab_1[i].first==tab_2[i].first) { counter++; } if(tab_1[i].second==tab_2[i].second) { counter++; } } if(counter==52) { cout<<"TAK"<<endl; } else { cout<<"NIE"<<endl; } return 0; } |
English