#include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define sz(x) int((x).size()) #define dbg(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (__typeof(t.begin()) i = t.begin(); i != t.end(); ++i) #define fi first #define se second typedef pair<int,int> pii; typedef vector<int> vi; typedef long long ll; typedef unsigned long long int ull; set<pair<int,int> > lol; set<int> lol2; map<ull,ull> mem; ull mm = 1000000000000000000LL; ull mulMod(ull a, ull b) { ull w=0; ull m=1; while(m) { if (b&m) w = (w+a)%mm; a = (a<<1)%mm; m<<=1; } return w; } ull fastFib(ull n) { if (n == 0) return 0; if (n <= 2) return 1; map<ull,ull>::iterator it = mem.find(n); if (it != mem.end()) return it->second; ull k = n/2; ull a = fastFib(k); ull b = fastFib(k+1); ull ans; if (n%2 == 1) { ans = (mulMod(a,a) + mulMod(b,b)) % mm; } else { ull tmp = 2*b; while (tmp < a) tmp += mm; ans = mulMod(a,tmp-a); } ans=ans%mm; mem[n] = ans; return ans; } ull toULL(string s) { stringstream ss(s); ull tmp; ss >> tmp; return tmp; } ull pow10(int a) { ull r=1; for (int i=0;i<a;++i) r*=10; return r; } int digit(int a, ull x) { if (a == 1) return x%10; else return (x/pow10(a-1))%10; } int main() { string s; cin >> s; if (s == "0") { cout << 0 << endl; return 0; } int len = s.length(); if (len <= 4) { int x = toULL(s); int a = 0; int b = 1; int c = 1; int i=2; while(i<150005) { c = a+b; c = c%pow10(len); if (c==x) { if (i>18 || (i<18 && s[0]!='0')) { cout << i << endl; return 0; } } a = b; b = c; i++; } cout << "NIE\n"; return 0; } else { int x = toULL(s)%10000; int a = 610; int b = 987; int c = 1597; ull i=17; vector<ull> props; while(i<15017) { c = a+b; c = c%10000; if (c==x) { props.pb(i); } a = b; b = c; i++; } for(int k=5;k<=len;++k) { vector<ull> props2; int d = s[len-k] - '0'; FOR(j, props.size()) { ull prop = props[j]; FOR(jj,10) { if (digit(k,fastFib(prop))==d) { if (d != 0 || prop > 87 || pow10(k-1) <= fastFib(prop)) { props2.pb(prop); } } prop += 15*pow10(k-2); } } props.clear(); props = props2; } if (props.empty()) { cout << "NIE\n"; } else { cout << props[0] << 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 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 | #include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define sz(x) int((x).size()) #define dbg(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (__typeof(t.begin()) i = t.begin(); i != t.end(); ++i) #define fi first #define se second typedef pair<int,int> pii; typedef vector<int> vi; typedef long long ll; typedef unsigned long long int ull; set<pair<int,int> > lol; set<int> lol2; map<ull,ull> mem; ull mm = 1000000000000000000LL; ull mulMod(ull a, ull b) { ull w=0; ull m=1; while(m) { if (b&m) w = (w+a)%mm; a = (a<<1)%mm; m<<=1; } return w; } ull fastFib(ull n) { if (n == 0) return 0; if (n <= 2) return 1; map<ull,ull>::iterator it = mem.find(n); if (it != mem.end()) return it->second; ull k = n/2; ull a = fastFib(k); ull b = fastFib(k+1); ull ans; if (n%2 == 1) { ans = (mulMod(a,a) + mulMod(b,b)) % mm; } else { ull tmp = 2*b; while (tmp < a) tmp += mm; ans = mulMod(a,tmp-a); } ans=ans%mm; mem[n] = ans; return ans; } ull toULL(string s) { stringstream ss(s); ull tmp; ss >> tmp; return tmp; } ull pow10(int a) { ull r=1; for (int i=0;i<a;++i) r*=10; return r; } int digit(int a, ull x) { if (a == 1) return x%10; else return (x/pow10(a-1))%10; } int main() { string s; cin >> s; if (s == "0") { cout << 0 << endl; return 0; } int len = s.length(); if (len <= 4) { int x = toULL(s); int a = 0; int b = 1; int c = 1; int i=2; while(i<150005) { c = a+b; c = c%pow10(len); if (c==x) { if (i>18 || (i<18 && s[0]!='0')) { cout << i << endl; return 0; } } a = b; b = c; i++; } cout << "NIE\n"; return 0; } else { int x = toULL(s)%10000; int a = 610; int b = 987; int c = 1597; ull i=17; vector<ull> props; while(i<15017) { c = a+b; c = c%10000; if (c==x) { props.pb(i); } a = b; b = c; i++; } for(int k=5;k<=len;++k) { vector<ull> props2; int d = s[len-k] - '0'; FOR(j, props.size()) { ull prop = props[j]; FOR(jj,10) { if (digit(k,fastFib(prop))==d) { if (d != 0 || prop > 87 || pow10(k-1) <= fastFib(prop)) { props2.pb(prop); } } prop += 15*pow10(k-2); } } props.clear(); props = props2; } if (props.empty()) { cout << "NIE\n"; } else { cout << props[0] << endl; } } return 0; } |