#include <iostream> #include <vector> using namespace std; int main() { int n, poz; cin >> n; int Bajtus[26] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }; int Bitus[26] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }; poz = 0; while (poz < n) { char c; cin >> c; Bajtus[c - 'a']++; poz++; } poz = 0; while (poz < n) { char c; cin >> c; Bitus[c - 'a']++; poz++; } for (short i = 0; i < 26; i++) { if (Bitus[i] != Bajtus[i]) { cout << "NIE" << endl; return 0; } } cout << "TAK" << 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 | #include <iostream> #include <vector> using namespace std; int main() { int n, poz; cin >> n; int Bajtus[26] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }; int Bitus[26] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }; poz = 0; while (poz < n) { char c; cin >> c; Bajtus[c - 'a']++; poz++; } poz = 0; while (poz < n) { char c; cin >> c; Bitus[c - 'a']++; poz++; } for (short i = 0; i < 26; i++) { if (Bitus[i] != Bajtus[i]) { cout << "NIE" << endl; return 0; } } cout << "TAK" << endl; return 0; } |