#include <iostream> using namespace std; int main() { int n, number, halfNumber; int fibs[] = {1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733}; cin >> n; while (n--){ cin >> number; halfNumber = (number >> 1); bool testPass = false; for (int i = 0; i < 43; i++){ if (number < fibs[i]) break; if (number == fibs[i]){ testPass = true; break; } } if (testPass){ cout << "TAK" << endl; continue; } for (int i = 1; i < 43; i++){ if (halfNumber < fibs[i]) break; if (!(number % fibs[i])){ int temp = number / fibs[i]; for (int j = 1; j < 43; j++){ if (temp < fibs[j]) break; if (temp == fibs[j]){ testPass = true; break; } } } if (testPass) break; } if (testPass) cout << "TAK" << endl; else cout << "NIE" << endl; } }
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 | #include <iostream> using namespace std; int main() { int n, number, halfNumber; int fibs[] = {1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733}; cin >> n; while (n--){ cin >> number; halfNumber = (number >> 1); bool testPass = false; for (int i = 0; i < 43; i++){ if (number < fibs[i]) break; if (number == fibs[i]){ testPass = true; break; } } if (testPass){ cout << "TAK" << endl; continue; } for (int i = 1; i < 43; i++){ if (halfNumber < fibs[i]) break; if (!(number % fibs[i])){ int temp = number / fibs[i]; for (int j = 1; j < 43; j++){ if (temp < fibs[j]) break; if (temp == fibs[j]){ testPass = true; break; } } } if (testPass) break; } if (testPass) cout << "TAK" << endl; else cout << "NIE" << endl; } } |