#include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; const int N = 60; const unsigned long long MOD = 1e18; const unsigned long long C = 1e9; unsigned long long Okres[N]; unsigned long long R[N]; vector <unsigned long long> K; vector <unsigned long long> Pom; void Wczytaj(int &n){ string s; int j,i; unsigned long long wsp; cin >> s; n = s.size(); wsp = 1; j = 0; for(i=n-1; i>=0; i--){ R[j] = wsp*((unsigned long long)s[i]-(unsigned long long)'0'); if(j!=0) R[j] += R[j-1]; j++; wsp *= 10; } } unsigned long long Ch(unsigned long long a,unsigned long long b){ unsigned long long wynik; wynik = 0; //if(a<C && b<C) return (a*b)%MOD; while(b>0){ if(b%2 == 1){ wynik += a; wynik %= MOD; b--; } a *= 2; b /= 2; a %= MOD; } return wynik; } vector < pair <unsigned long long,unsigned long long> > Mnoz(vector < pair <unsigned long long,unsigned long long> > V1,vector < pair <unsigned long long,unsigned long long> > V2){ int i,j,k; unsigned long long a1,a2; vector < pair <unsigned long long,unsigned long long> > Wynik; a1 = Ch(V1[0].first,V2[0].first)+Ch(V1[0].second,V2[1].first); a2 = Ch(V1[0].first,V2[0].second)+Ch(V1[0].second,V2[1].second); Wynik.push_back( make_pair(a1%MOD,a2%MOD) ); a1 = Ch(V1[1].first,V2[0].first)+Ch(V1[1].second,V2[1].first); a2 = Ch(V1[1].first,V2[0].second)+Ch(V1[1].second,V2[1].second); Wynik.push_back( make_pair(a1%MOD,a2%MOD) ); return Wynik; } vector < pair <unsigned long long,unsigned long long> > Fib(unsigned long long t){ int i,j; vector < pair <unsigned long long,unsigned long long> > M,P; M.push_back(make_pair(1,1)); M.push_back(make_pair(1,0)); P = M; while(t>0){ if(t%2 == 1) M = Mnoz(M,P); t /= 2; P = Mnoz(P,P); } return M; } void Inicjuj(){ unsigned long long i,war; i = 0; while(i<N){ war = Fib(i)[1].second; //cout << war << " "; if(war%10 == R[0]) K.push_back(i); i++; } Okres[0] = 60; Okres[1] = 300; war = 100; for(i=2; i<=18; i++){ Okres[i] = 15*war; war *= 10; } } int main(){ unsigned long long a_ind,a_war,pot; vector < pair <unsigned long long,unsigned long long> > a_f,stala; int i,j; int n; Wczytaj(n); Inicjuj(); pot = 100; //cout << MOD << "\n"; if(R[n-1]==MOD) { cout << 1500000000000000000 << "\n"; return 0; } //cout << K.size() << "\n"; for(i=1; i<n; i++){ Pom.clear(); stala = Fib(Okres[i-1]-1); for(j=0; j<K.size(); j++){ a_ind = K[j]; a_f = Fib(a_ind); while(a_ind <= Okres[i]){ //cout << a_ind << " " << a_f[1].second << " | "; if(a_f[1].second%pot == R[i]) Pom.push_back(a_ind); a_f = Mnoz(a_f,stala); a_ind += Okres[i-1]; } //cout << "\n"; } K.clear(); K = Pom; //cout << K.size() << "\n"; pot *= 10; } if(K.size() == 0) cout << "NIE\n"; else cout << K.back()+Okres[n-1] << "\n"; //cout << K.size() << "\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 | #include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; const int N = 60; const unsigned long long MOD = 1e18; const unsigned long long C = 1e9; unsigned long long Okres[N]; unsigned long long R[N]; vector <unsigned long long> K; vector <unsigned long long> Pom; void Wczytaj(int &n){ string s; int j,i; unsigned long long wsp; cin >> s; n = s.size(); wsp = 1; j = 0; for(i=n-1; i>=0; i--){ R[j] = wsp*((unsigned long long)s[i]-(unsigned long long)'0'); if(j!=0) R[j] += R[j-1]; j++; wsp *= 10; } } unsigned long long Ch(unsigned long long a,unsigned long long b){ unsigned long long wynik; wynik = 0; //if(a<C && b<C) return (a*b)%MOD; while(b>0){ if(b%2 == 1){ wynik += a; wynik %= MOD; b--; } a *= 2; b /= 2; a %= MOD; } return wynik; } vector < pair <unsigned long long,unsigned long long> > Mnoz(vector < pair <unsigned long long,unsigned long long> > V1,vector < pair <unsigned long long,unsigned long long> > V2){ int i,j,k; unsigned long long a1,a2; vector < pair <unsigned long long,unsigned long long> > Wynik; a1 = Ch(V1[0].first,V2[0].first)+Ch(V1[0].second,V2[1].first); a2 = Ch(V1[0].first,V2[0].second)+Ch(V1[0].second,V2[1].second); Wynik.push_back( make_pair(a1%MOD,a2%MOD) ); a1 = Ch(V1[1].first,V2[0].first)+Ch(V1[1].second,V2[1].first); a2 = Ch(V1[1].first,V2[0].second)+Ch(V1[1].second,V2[1].second); Wynik.push_back( make_pair(a1%MOD,a2%MOD) ); return Wynik; } vector < pair <unsigned long long,unsigned long long> > Fib(unsigned long long t){ int i,j; vector < pair <unsigned long long,unsigned long long> > M,P; M.push_back(make_pair(1,1)); M.push_back(make_pair(1,0)); P = M; while(t>0){ if(t%2 == 1) M = Mnoz(M,P); t /= 2; P = Mnoz(P,P); } return M; } void Inicjuj(){ unsigned long long i,war; i = 0; while(i<N){ war = Fib(i)[1].second; //cout << war << " "; if(war%10 == R[0]) K.push_back(i); i++; } Okres[0] = 60; Okres[1] = 300; war = 100; for(i=2; i<=18; i++){ Okres[i] = 15*war; war *= 10; } } int main(){ unsigned long long a_ind,a_war,pot; vector < pair <unsigned long long,unsigned long long> > a_f,stala; int i,j; int n; Wczytaj(n); Inicjuj(); pot = 100; //cout << MOD << "\n"; if(R[n-1]==MOD) { cout << 1500000000000000000 << "\n"; return 0; } //cout << K.size() << "\n"; for(i=1; i<n; i++){ Pom.clear(); stala = Fib(Okres[i-1]-1); for(j=0; j<K.size(); j++){ a_ind = K[j]; a_f = Fib(a_ind); while(a_ind <= Okres[i]){ //cout << a_ind << " " << a_f[1].second << " | "; if(a_f[1].second%pot == R[i]) Pom.push_back(a_ind); a_f = Mnoz(a_f,stala); a_ind += Okres[i-1]; } //cout << "\n"; } K.clear(); K = Pom; //cout << K.size() << "\n"; pot *= 10; } if(K.size() == 0) cout << "NIE\n"; else cout << K.back()+Okres[n-1] << "\n"; //cout << K.size() << "\n"; return 0; } |