#include <iostream> #include <string> using namespace std; int main() { string napis; cin >> napis; unsigned long long fib[2] = { 0ULL, 1ULL }; while(napis[0] == '0') napis.erase(napis.begin()); int len = napis.length(); unsigned long long currNum = 0ULL; unsigned long long k = 2ULL; while (k <= 1.e+100) { currNum = fib[0] + fib[1]; string currStr = to_string(currNum); int currLen = currStr.length(); if (currLen >= len && currStr.substr(currLen - len, len) == napis) { cout << k << endl; return 0; } fib[0] = fib[1]; fib[1] = currNum; k++; } 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 | #include <iostream> #include <string> using namespace std; int main() { string napis; cin >> napis; unsigned long long fib[2] = { 0ULL, 1ULL }; while(napis[0] == '0') napis.erase(napis.begin()); int len = napis.length(); unsigned long long currNum = 0ULL; unsigned long long k = 2ULL; while (k <= 1.e+100) { currNum = fib[0] + fib[1]; string currStr = to_string(currNum); int currLen = currStr.length(); if (currLen >= len && currStr.substr(currLen - len, len) == napis) { cout << k << endl; return 0; } fib[0] = fib[1]; fib[1] = currNum; k++; } cout << "NIE" << endl; return 0; } |