#include <iostream> #include <algorithm> using namespace std; typedef long long ll; const ll mod = 999999999989; const int base = 29; int getNumber(char a) { return a - 'a'; } int main() { int forwardHash = 0; int backwardHash = 0; int mnoznik = 1; int n; cin >> n; char a; while(cin >> a) { int num = getNumber(a); forwardHash = (forwardHash * base) % mod; forwardHash = (forwardHash + num) % mod; backwardHash = (backwardHash + ((num * mnoznik) % mod) ) % mod; mnoznik = (mnoznik * base) % mod; } if(backwardHash == forwardHash) { cout << "TAK\n"; } else { cout << "NIE\n"; } 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 <algorithm> using namespace std; typedef long long ll; const ll mod = 999999999989; const int base = 29; int getNumber(char a) { return a - 'a'; } int main() { int forwardHash = 0; int backwardHash = 0; int mnoznik = 1; int n; cin >> n; char a; while(cin >> a) { int num = getNumber(a); forwardHash = (forwardHash * base) % mod; forwardHash = (forwardHash + num) % mod; backwardHash = (backwardHash + ((num * mnoznik) % mod) ) % mod; mnoznik = (mnoznik * base) % mod; } if(backwardHash == forwardHash) { cout << "TAK\n"; } else { cout << "NIE\n"; } return 0; } |