/* wykorzytsuje http://rafalnowak.pl/wiki/index.php?title=Liczby_Fibonacciego */ #include<cstdio> #include <iostream> #include <string> using namespace std; long long m; struct matrix { long long a, b, c, d; matrix(long long aa = 0, long long bb = 1, long long cc = 1, long long dd = 0) {a = aa; b = bb; c = cc; d = dd;} matrix operator* (matrix x) { matrix w; w.a = ((a% m * x.a% m) % m + (b % m* x.c) % m) % m; w.b = ((a% m * x.b% m) % m + (b % m* x.d) % m) % m; w.c = ((c % m* x.a% m) % m + (d % m* x.c) % m) % m; w.d = ((c % m* x.b% m) % m + (d % m* x.d) % m) % m; return w; } }; matrix power(matrix x, long long n) { if(n == 0) return matrix(); matrix y = power(x, n/2); y = y * y; if(n % 2) return y * x; return y; } /*void test() { long long n; //scanf("%d%d", &n, &m); cin>>n>>m; matrix x(0,1,1,1); x = power(x, n); cout<< x.c<<"\n"; }*/ int ile = 0; int main() { string s; cin>>s; int fib1=1; int fib2=1; int temp; bool ok = false; if(s.size()==1){ int g = (int)s[0]-48; fib1=1; fib2=1; for(int i=3;i<=60;i++){ temp = fib1+fib2; temp%=10; fib1=fib2; fib2=temp; cout<<temp<<"\n"; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else if(s.size()==2){ int g = (int)s[1]-48+((int)s[0]-48)*10; fib1=1; fib2=1; for(int i=3;i<=300;i++){ temp = fib1+fib2; temp%=100; fib1=fib2; fib2=temp; cout<<temp<<"\n"; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else if(s.size()==3){ int g = (int)s[2]-48+((int)s[1]-48)*10+((int)s[0]-48)*100; fib1=1; fib2=1; for(int i=3;i<=1500;i++){ temp = fib1+fib2; temp%=1000; fib1=fib2; fib2=temp; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else if(s.size()==4){ int g = (int)s[3]-48+((int)s[2]-48)*10+((int)s[1]-48)*100+((int)s[0]-48)*1000; fib1=1; fib2=1; for(int i=3;i<=15000;i++){ temp = fib1+fib2; temp%=1000; fib1=fib2; fib2=temp; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else if(s.size()==5){ int g = (int)s[4]-48+((int)s[3]-48)*10+((int)s[2]-48)*100+((int)s[1]-48)*1000+((int)s[0]-48)*10000; fib1=1; fib2=1; for(int i=3;i<=150000;i++){ temp = fib1+fib2; temp%=10000; fib1=fib2; fib2=temp; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else{ } if(!ok){ cout<<"NIE\n"; } }
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 | /* wykorzytsuje http://rafalnowak.pl/wiki/index.php?title=Liczby_Fibonacciego */ #include<cstdio> #include <iostream> #include <string> using namespace std; long long m; struct matrix { long long a, b, c, d; matrix(long long aa = 0, long long bb = 1, long long cc = 1, long long dd = 0) {a = aa; b = bb; c = cc; d = dd;} matrix operator* (matrix x) { matrix w; w.a = ((a% m * x.a% m) % m + (b % m* x.c) % m) % m; w.b = ((a% m * x.b% m) % m + (b % m* x.d) % m) % m; w.c = ((c % m* x.a% m) % m + (d % m* x.c) % m) % m; w.d = ((c % m* x.b% m) % m + (d % m* x.d) % m) % m; return w; } }; matrix power(matrix x, long long n) { if(n == 0) return matrix(); matrix y = power(x, n/2); y = y * y; if(n % 2) return y * x; return y; } /*void test() { long long n; //scanf("%d%d", &n, &m); cin>>n>>m; matrix x(0,1,1,1); x = power(x, n); cout<< x.c<<"\n"; }*/ int ile = 0; int main() { string s; cin>>s; int fib1=1; int fib2=1; int temp; bool ok = false; if(s.size()==1){ int g = (int)s[0]-48; fib1=1; fib2=1; for(int i=3;i<=60;i++){ temp = fib1+fib2; temp%=10; fib1=fib2; fib2=temp; cout<<temp<<"\n"; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else if(s.size()==2){ int g = (int)s[1]-48+((int)s[0]-48)*10; fib1=1; fib2=1; for(int i=3;i<=300;i++){ temp = fib1+fib2; temp%=100; fib1=fib2; fib2=temp; cout<<temp<<"\n"; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else if(s.size()==3){ int g = (int)s[2]-48+((int)s[1]-48)*10+((int)s[0]-48)*100; fib1=1; fib2=1; for(int i=3;i<=1500;i++){ temp = fib1+fib2; temp%=1000; fib1=fib2; fib2=temp; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else if(s.size()==4){ int g = (int)s[3]-48+((int)s[2]-48)*10+((int)s[1]-48)*100+((int)s[0]-48)*1000; fib1=1; fib2=1; for(int i=3;i<=15000;i++){ temp = fib1+fib2; temp%=1000; fib1=fib2; fib2=temp; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else if(s.size()==5){ int g = (int)s[4]-48+((int)s[3]-48)*10+((int)s[2]-48)*100+((int)s[1]-48)*1000+((int)s[0]-48)*10000; fib1=1; fib2=1; for(int i=3;i<=150000;i++){ temp = fib1+fib2; temp%=10000; fib1=fib2; fib2=temp; if(temp == g){ cout<<i<<"\n"; ok = true; break; } } }else{ } if(!ok){ cout<<"NIE\n"; } } |