#include<iostream> #include<cstdio> #include<bitset> #include<vector> using namespace std; long long tab[1000000][3]; long long mod=1000000000000000000; long long liczba[65]; bitset<65> bits; bitset<65> bits2; long long macierz[3]; int wejscie[19]; long long okres[19]; long long dziesiatki[19]; long long mnozenie(long long x,long long y){ if(x==0||y==0) return 0; int it=0; while(x){ if(it==0) liczba[it]=y; else{ liczba[it]=(2*liczba[it-1])%mod; } if(x%2) bits2[it]=1; else bits2[it]=0; x/=2; it++; } it--; long long wynik=0; while(it+1>0){ wynik+=bits2[it]*liczba[it]; wynik%=mod; it--; } return wynik; } long long ciag_fibonacciego(long long x){ int it=0; if(x==0) return 1; while(x){ if(x%2) bits[it]=1; else bits[it]=0; it++; x/=2; } it--; macierz[0]=tab[it+1][0]; macierz[1]=tab[it+1][1]; macierz[2]=tab[it+1][2]; //cout<<" "<<it<<endl; long long a, b, c; it--; while(it+1>0){ if(bits[it]){ a=(mnozenie(macierz[0],tab[it+1][0])+mnozenie(macierz[1],tab[it+1][1]))%mod; b=(mnozenie(macierz[1],tab[it+1][0])+mnozenie(macierz[2],tab[it+1][1]))%mod; c=(mnozenie(macierz[1],tab[it+1][1])+mnozenie(macierz[2],tab[it+1][2]))%mod; //cout<<" "<<it<<endl; macierz[0]=a; macierz[1]=b; macierz[2]=c; } it--; } return macierz[0]; } int main(){ dziesiatki[0]=1; for(int i=1;i<19;i++){ dziesiatki[i]=dziesiatki[i-1]*10; } tab[1][0]=1; tab[1][1]=1; tab[1][2]=0; for(int i=2;i<64;i++){ tab[i][0]=(mnozenie(tab[i-1][0],tab[i-1][0])+mnozenie(tab[i-1][1],tab[i-1][1]))%mod; tab[i][1]=(mnozenie(tab[i-1][0],tab[i-1][1])+mnozenie(tab[i-1][1],tab[i-1][2]))%mod; tab[i][2]=(mnozenie(tab[i-1][1],tab[i-1][1])+mnozenie(tab[i-1][2],tab[i-1][2]))%mod; //cout<<i<<" "<<tab[i][0]<<endl; } //for(int i=0;i<60;i++){ // cout<<i<<" "<<ciag_fibonacciego(i)<<endl; //} int n; string s; cin>>s; int dl=s.length(); for(int i=s.length()-1;i>=0;i--){ wejscie[s.length()-i]=s[i]-'0'; } okres[1]=60; okres[2]=300; okres[3]=1500; for(int i=4;i<19;i++){ okres[i]=okres[i-1]*10; } /* cout<<ciag_fibonacciego(59)<<" "<<ciag_fibonacciego(60)<<endl; cout<<ciag_fibonacciego(299)<<" "<<ciag_fibonacciego(300)<<endl; cout<<ciag_fibonacciego(1499)<<" "<<ciag_fibonacciego(1500)<<endl; cout<<ciag_fibonacciego(14999)<<" "<<ciag_fibonacciego(15000)<<endl; cout<<ciag_fibonacciego(149999)<<" "<<ciag_fibonacciego(150000)<<endl; cout<<ciag_fibonacciego(1499999)<<" "<<ciag_fibonacciego(1500000)<<endl; cout<<ciag_fibonacciego(14999999)<<" "<<ciag_fibonacciego(15000000)<<endl; cout<<ciag_fibonacciego(149999999)<<" "<<ciag_fibonacciego(150000000)<<endl; cout<<ciag_fibonacciego(1499999999)<<" "<<ciag_fibonacciego(1500000000)<<endl; cout<<ciag_fibonacciego(14999999999)<<" "<<ciag_fibonacciego(15000000000)<<endl; cout<<ciag_fibonacciego(149999999999)<<" "<<ciag_fibonacciego(150000000000)<<endl; cout<<ciag_fibonacciego(1499999999999)<<" "<<ciag_fibonacciego(1500000000000)<<endl; cout<<ciag_fibonacciego(14999999999999)<<" "<<ciag_fibonacciego(15000000000000)<<endl; cout<<ciag_fibonacciego(149999999999999)<<" "<<ciag_fibonacciego(150000000000000)<<endl; cout<<ciag_fibonacciego(1499999999999999)<<" "<<ciag_fibonacciego(1500000000000000)<<endl; cout<<ciag_fibonacciego(14999999999999999)<<" "<<ciag_fibonacciego(15000000000000000)<<endl; cout<<ciag_fibonacciego(149999999999999999)<<" "<<ciag_fibonacciego(150000000000000000)<<endl; cout<<ciag_fibonacciego(1499999999999999999)<<" "<<ciag_fibonacciego(1500000000000000000)<<endl; */ vector<long long> wek[19]; for(int i=0;i<60;i++){ if(ciag_fibonacciego(i)%10==wejscie[1]){ wek[1].push_back(i); //cout<<"PUSH BACK "<<wejscie[1]<<" "<<i<<endl; } } for(int i=2;i<=dl;i++){ for(int j=0;j<wek[i-1].size();j++){ for(long long k=wek[i-1][j];k<okres[i];k+=okres[i-1]){ //cout<<k<<" "<<ciag_fibonacciego(k)<<endl; if((ciag_fibonacciego(k)/dziesiatki[i-1])%10==wejscie[i]){ wek[i].push_back(k); //cout<<"PUSH BACK "<<wejscie[i]<<" "<<k<<endl; } } } } /*cout<<"_________________"<<endl; for(int i=1;i<=dl;i++){ for(int j=0;j<wek[i].size();j++){ cout<<wek[i][j]<<" "; } cout<<endl; }*/ long long wynik, wynik2; int digits=0; if(wek[dl].size()==0) printf("NIE"); else{ printf("150000000000000000000"); printf("%lld",wek[dl][0]+1); } /*else{ for(int i=0;i<wek[dl].size();i++){ if(wek[dl][i]>88){ printf("%lld",wek[dl][i]); b=1; break; } if(b) break; } if(!b){ } }*/ }
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 162 163 164 165 166 167 168 | #include<iostream> #include<cstdio> #include<bitset> #include<vector> using namespace std; long long tab[1000000][3]; long long mod=1000000000000000000; long long liczba[65]; bitset<65> bits; bitset<65> bits2; long long macierz[3]; int wejscie[19]; long long okres[19]; long long dziesiatki[19]; long long mnozenie(long long x,long long y){ if(x==0||y==0) return 0; int it=0; while(x){ if(it==0) liczba[it]=y; else{ liczba[it]=(2*liczba[it-1])%mod; } if(x%2) bits2[it]=1; else bits2[it]=0; x/=2; it++; } it--; long long wynik=0; while(it+1>0){ wynik+=bits2[it]*liczba[it]; wynik%=mod; it--; } return wynik; } long long ciag_fibonacciego(long long x){ int it=0; if(x==0) return 1; while(x){ if(x%2) bits[it]=1; else bits[it]=0; it++; x/=2; } it--; macierz[0]=tab[it+1][0]; macierz[1]=tab[it+1][1]; macierz[2]=tab[it+1][2]; //cout<<" "<<it<<endl; long long a, b, c; it--; while(it+1>0){ if(bits[it]){ a=(mnozenie(macierz[0],tab[it+1][0])+mnozenie(macierz[1],tab[it+1][1]))%mod; b=(mnozenie(macierz[1],tab[it+1][0])+mnozenie(macierz[2],tab[it+1][1]))%mod; c=(mnozenie(macierz[1],tab[it+1][1])+mnozenie(macierz[2],tab[it+1][2]))%mod; //cout<<" "<<it<<endl; macierz[0]=a; macierz[1]=b; macierz[2]=c; } it--; } return macierz[0]; } int main(){ dziesiatki[0]=1; for(int i=1;i<19;i++){ dziesiatki[i]=dziesiatki[i-1]*10; } tab[1][0]=1; tab[1][1]=1; tab[1][2]=0; for(int i=2;i<64;i++){ tab[i][0]=(mnozenie(tab[i-1][0],tab[i-1][0])+mnozenie(tab[i-1][1],tab[i-1][1]))%mod; tab[i][1]=(mnozenie(tab[i-1][0],tab[i-1][1])+mnozenie(tab[i-1][1],tab[i-1][2]))%mod; tab[i][2]=(mnozenie(tab[i-1][1],tab[i-1][1])+mnozenie(tab[i-1][2],tab[i-1][2]))%mod; //cout<<i<<" "<<tab[i][0]<<endl; } //for(int i=0;i<60;i++){ // cout<<i<<" "<<ciag_fibonacciego(i)<<endl; //} int n; string s; cin>>s; int dl=s.length(); for(int i=s.length()-1;i>=0;i--){ wejscie[s.length()-i]=s[i]-'0'; } okres[1]=60; okres[2]=300; okres[3]=1500; for(int i=4;i<19;i++){ okres[i]=okres[i-1]*10; } /* cout<<ciag_fibonacciego(59)<<" "<<ciag_fibonacciego(60)<<endl; cout<<ciag_fibonacciego(299)<<" "<<ciag_fibonacciego(300)<<endl; cout<<ciag_fibonacciego(1499)<<" "<<ciag_fibonacciego(1500)<<endl; cout<<ciag_fibonacciego(14999)<<" "<<ciag_fibonacciego(15000)<<endl; cout<<ciag_fibonacciego(149999)<<" "<<ciag_fibonacciego(150000)<<endl; cout<<ciag_fibonacciego(1499999)<<" "<<ciag_fibonacciego(1500000)<<endl; cout<<ciag_fibonacciego(14999999)<<" "<<ciag_fibonacciego(15000000)<<endl; cout<<ciag_fibonacciego(149999999)<<" "<<ciag_fibonacciego(150000000)<<endl; cout<<ciag_fibonacciego(1499999999)<<" "<<ciag_fibonacciego(1500000000)<<endl; cout<<ciag_fibonacciego(14999999999)<<" "<<ciag_fibonacciego(15000000000)<<endl; cout<<ciag_fibonacciego(149999999999)<<" "<<ciag_fibonacciego(150000000000)<<endl; cout<<ciag_fibonacciego(1499999999999)<<" "<<ciag_fibonacciego(1500000000000)<<endl; cout<<ciag_fibonacciego(14999999999999)<<" "<<ciag_fibonacciego(15000000000000)<<endl; cout<<ciag_fibonacciego(149999999999999)<<" "<<ciag_fibonacciego(150000000000000)<<endl; cout<<ciag_fibonacciego(1499999999999999)<<" "<<ciag_fibonacciego(1500000000000000)<<endl; cout<<ciag_fibonacciego(14999999999999999)<<" "<<ciag_fibonacciego(15000000000000000)<<endl; cout<<ciag_fibonacciego(149999999999999999)<<" "<<ciag_fibonacciego(150000000000000000)<<endl; cout<<ciag_fibonacciego(1499999999999999999)<<" "<<ciag_fibonacciego(1500000000000000000)<<endl; */ vector<long long> wek[19]; for(int i=0;i<60;i++){ if(ciag_fibonacciego(i)%10==wejscie[1]){ wek[1].push_back(i); //cout<<"PUSH BACK "<<wejscie[1]<<" "<<i<<endl; } } for(int i=2;i<=dl;i++){ for(int j=0;j<wek[i-1].size();j++){ for(long long k=wek[i-1][j];k<okres[i];k+=okres[i-1]){ //cout<<k<<" "<<ciag_fibonacciego(k)<<endl; if((ciag_fibonacciego(k)/dziesiatki[i-1])%10==wejscie[i]){ wek[i].push_back(k); //cout<<"PUSH BACK "<<wejscie[i]<<" "<<k<<endl; } } } } /*cout<<"_________________"<<endl; for(int i=1;i<=dl;i++){ for(int j=0;j<wek[i].size();j++){ cout<<wek[i][j]<<" "; } cout<<endl; }*/ long long wynik, wynik2; int digits=0; if(wek[dl].size()==0) printf("NIE"); else{ printf("150000000000000000000"); printf("%lld",wek[dl][0]+1); } /*else{ for(int i=0;i<wek[dl].size();i++){ if(wek[dl][i]>88){ printf("%lld",wek[dl][i]); b=1; break; } if(b) break; } if(!b){ } }*/ } |