#include <iostream> #include <vector> #include <string> using namespace std; int main() { int n; cin >> n; if (n) { vector<char> firstHalf(n/2); int i; for (i = 0; i < firstHalf.size(); ++i) { cin >> firstHalf[i]; } if (n % 2 == 1) { cin.ignore(); ++i; } for (; i < n; ++i) { if (cin.get() != firstHalf[n - i - 1]) { cout << "NIE" << endl; return 0; } } } else { string word; cin.ignore(); getline(cin, word); n = word.size(); for (int i=0; i < n/2; ++i) { if (word[i] != word[n - i - 1]) { 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 37 38 39 40 41 42 43 44 45 46 47 48 49 50 | #include <iostream> #include <vector> #include <string> using namespace std; int main() { int n; cin >> n; if (n) { vector<char> firstHalf(n/2); int i; for (i = 0; i < firstHalf.size(); ++i) { cin >> firstHalf[i]; } if (n % 2 == 1) { cin.ignore(); ++i; } for (; i < n; ++i) { if (cin.get() != firstHalf[n - i - 1]) { cout << "NIE" << endl; return 0; } } } else { string word; cin.ignore(); getline(cin, word); n = word.size(); for (int i=0; i < n/2; ++i) { if (word[i] != word[n - i - 1]) { cout << "NIE" << endl; return 0; } } } cout << "TAK" << endl; return 0; } |