#include <cstdlib> #include <iostream> #include <vector> using namespace std; typedef unsigned long long ULL; const ULL M=ULL(1000*1000*1000)*ULL(1000*1000*1000); ULL mul_mod (ULL a, ULL b) { ULL wyn = 0; a%=M; b%=M; for (; b; a<<=1, b>>=1) { if (a>=M) a-=M; if (b&1) { wyn+=a; if (wyn>=M) wyn-=M; } } return wyn; } class fib_num { public: fib_num() : num(0) , vals{{0, 0}, {0, 0}} {} fib_num(int w) { if (w == 0) { num = 0; vals[0][0] = vals[1][1] = 1; vals[1][0] = vals[0][1] = 0; } else if (w == 1) { num = 1; vals[0][0] = 0; vals[1][0] = vals[0][1] = vals[1][1] = 1; } else { throw; } } fib_num operator+(const fib_num& b) { fib_num w; w.num = this->num+b.num; w.vals[0][0] = mul_mod(this->vals[0][0], b.vals[0][0]) + mul_mod(this->vals[0][1], b.vals[1][0]); w.vals[0][1] = mul_mod(this->vals[0][0], b.vals[0][1]) + mul_mod(this->vals[0][1], b.vals[1][1]); w.vals[1][0] = mul_mod(this->vals[1][0], b.vals[0][0]) + mul_mod(this->vals[1][1], b.vals[1][0]); w.vals[1][1] = mul_mod(this->vals[1][0], b.vals[0][1]) + mul_mod(this->vals[1][1], b.vals[1][1]); return w; } void describe () { printf("matrix no %lld:\n", num); printf("%lld\t%lld\n%lld\t%lld\n", vals[0][0], vals[0][1], vals[1][0], vals[1][1]); } ULL num; ULL vals[2][2]; }; ULL pow10[30]; int digits[30]; int n = 0; int k_digit (ULL num, int k) { return (num/pow10[k-1])%10; } void find_num (fib_num mult, fib_num reminder, int digit_no) { if (digit_no > n) { if (reminder.vals[0][1] < pow10[n-1]) return; printf("%lld\n", reminder.num); exit(0); } int first = k_digit(reminder.vals[0][1], digit_no), second = k_digit(reminder.vals[1][1], digit_no); fib_num new_mult = 0; fib_num acc = new_mult+reminder; int c_first = k_digit(acc.vals[0][1], digit_no), c_second = k_digit(acc.vals[1][1], digit_no); vector<fib_num> next_layer; int q=0; while (true) { q++; if (c_first == digits[digit_no]) next_layer.push_back(acc); new_mult = new_mult+mult; acc = new_mult + reminder; c_first = k_digit(acc.vals[0][1], digit_no), c_second = k_digit(acc.vals[1][1], digit_no); if (c_first == first && c_second == second) break; } for (auto e : next_layer) find_num(new_mult, e, digit_no+1); } int main () { string s; cin>>s; for (int i=s.size()-1; i>=0; i--) digits[1+n++] = s[i]-'0'; pow10[0] = 1; for (int i=1; i<=n; i++) pow10[i]=pow10[i-1]*10; find_num(fib_num(1), fib_num(0), 1); printf("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 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 | #include <cstdlib> #include <iostream> #include <vector> using namespace std; typedef unsigned long long ULL; const ULL M=ULL(1000*1000*1000)*ULL(1000*1000*1000); ULL mul_mod (ULL a, ULL b) { ULL wyn = 0; a%=M; b%=M; for (; b; a<<=1, b>>=1) { if (a>=M) a-=M; if (b&1) { wyn+=a; if (wyn>=M) wyn-=M; } } return wyn; } class fib_num { public: fib_num() : num(0) , vals{{0, 0}, {0, 0}} {} fib_num(int w) { if (w == 0) { num = 0; vals[0][0] = vals[1][1] = 1; vals[1][0] = vals[0][1] = 0; } else if (w == 1) { num = 1; vals[0][0] = 0; vals[1][0] = vals[0][1] = vals[1][1] = 1; } else { throw; } } fib_num operator+(const fib_num& b) { fib_num w; w.num = this->num+b.num; w.vals[0][0] = mul_mod(this->vals[0][0], b.vals[0][0]) + mul_mod(this->vals[0][1], b.vals[1][0]); w.vals[0][1] = mul_mod(this->vals[0][0], b.vals[0][1]) + mul_mod(this->vals[0][1], b.vals[1][1]); w.vals[1][0] = mul_mod(this->vals[1][0], b.vals[0][0]) + mul_mod(this->vals[1][1], b.vals[1][0]); w.vals[1][1] = mul_mod(this->vals[1][0], b.vals[0][1]) + mul_mod(this->vals[1][1], b.vals[1][1]); return w; } void describe () { printf("matrix no %lld:\n", num); printf("%lld\t%lld\n%lld\t%lld\n", vals[0][0], vals[0][1], vals[1][0], vals[1][1]); } ULL num; ULL vals[2][2]; }; ULL pow10[30]; int digits[30]; int n = 0; int k_digit (ULL num, int k) { return (num/pow10[k-1])%10; } void find_num (fib_num mult, fib_num reminder, int digit_no) { if (digit_no > n) { if (reminder.vals[0][1] < pow10[n-1]) return; printf("%lld\n", reminder.num); exit(0); } int first = k_digit(reminder.vals[0][1], digit_no), second = k_digit(reminder.vals[1][1], digit_no); fib_num new_mult = 0; fib_num acc = new_mult+reminder; int c_first = k_digit(acc.vals[0][1], digit_no), c_second = k_digit(acc.vals[1][1], digit_no); vector<fib_num> next_layer; int q=0; while (true) { q++; if (c_first == digits[digit_no]) next_layer.push_back(acc); new_mult = new_mult+mult; acc = new_mult + reminder; c_first = k_digit(acc.vals[0][1], digit_no), c_second = k_digit(acc.vals[1][1], digit_no); if (c_first == first && c_second == second) break; } for (auto e : next_layer) find_num(new_mult, e, digit_no+1); } int main () { string s; cin>>s; for (int i=s.size()-1; i>=0; i--) digits[1+n++] = s[i]-'0'; pow10[0] = 1; for (int i=1; i<=n; i++) pow10[i]=pow10[i-1]*10; find_num(fib_num(1), fib_num(0), 1); printf("NIE\n"); return 0; } |