#include<bits/stdc++.h> using namespace std; typedef pair<int,int> PI; typedef long long LL; typedef double D; #define FI first #define SE second #define MP make_pair #define PB push_back #define R(I,N) for(int I=0;I<N;I++) #define F(I,A,B) for(int I=A;I<B;I++) #define FD(I,N) for(int I=N-1;I>=0;I--) #define make(A) scanf("%d",&A) #define make2(A,B) scanf("%d%d",&A,&B) #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define db if(1)printf template<typename C> void MA(C& a,C b){if(a<b)a=b;} template<typename C> void MI(C& a,C b){if(a>b)a=b;} int n=0; LL x; char z; unsigned long long mod = 1; unsigned long long pommod = 1; LL razy(unsigned long long a,unsigned long long b){ return ((a/pommod * b + b/pommod * a) % pommod * pommod + (a%pommod) * (b%pommod)) % mod; } LL pom[2][2]; struct mac{ LL t[2][2]; mac(){ t[0][0] = t[1][1] = 1; t[0][1] = t[1][0] = 0; } void fib(){ t[0][0] = 0; t[0][1] = t[1][0] = t[1][1] = 1; } void operator*=(mac &x){ R(i,2)R(j,2){ pom[i][j] = razy(t[i][0], x.t[0][j]) + razy(t[i][1], x.t[1][j]); } R(i,2)R(j,2) t[i][j] = pom[i][j]%mod; } void wys(){ R(i,2){ R(j,2)printf("%lld ",(long long)t[i][j]); puts(""); } } }; mac fib(LL w){ mac res,a; a.fib(); while(w){ if(w&1) res*=a; w/=2; a*=a; } return res; } vector<pair<LL,mac> > kan,kan2; main(){ while(1){ scanf("%c",&z); if(z <= '9' && z >= '0'){ n++; if(n&1)pommod*=5; mod *= 5; x *= 10; x += z - '0'; }else break; } LL per = 20; mac pom,ak;pom.fib(); R(i,20){ if(ak.t[0][1] % 5 == x % 5) kan.PB({i,ak}); ak*=pom; } LL akmod = 5; R(i,n-1){ akmod *= 5; for(auto k:kan){ R(j,5){ if((k.SE.t[0][1]-x) % akmod == 0){ kan2.PB(k); } k.SE *= ak; k.FI += per; } } kan.clear(); swap(kan,kan2); mac ak2 = ak; R(i,4)ak *= ak2; per *= 5; } mod = 1<<n; pommod = 1<<((n+1)/2); for(auto &k:kan)k.SE = fib(k.FI); ak = fib(per); akmod = 1; R(i,n){ akmod*=2; int il = (i==0)*2 + (i>2)*1 + 1; for(auto k:kan){ R(j,il){ if((k.SE.t[0][1]-x) % akmod == 0){ kan2.PB(k); } k.SE *= ak; k.FI += per; } } kan.clear(); swap(kan,kan2); mac ak2 = ak; R(i,il-1)ak *= ak2; per *= il; } if(kan.size()){ printf("%lld\n",kan[0].FI + per); }else puts("NIE"); }
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 | #include<bits/stdc++.h> using namespace std; typedef pair<int,int> PI; typedef long long LL; typedef double D; #define FI first #define SE second #define MP make_pair #define PB push_back #define R(I,N) for(int I=0;I<N;I++) #define F(I,A,B) for(int I=A;I<B;I++) #define FD(I,N) for(int I=N-1;I>=0;I--) #define make(A) scanf("%d",&A) #define make2(A,B) scanf("%d%d",&A,&B) #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define db if(1)printf template<typename C> void MA(C& a,C b){if(a<b)a=b;} template<typename C> void MI(C& a,C b){if(a>b)a=b;} int n=0; LL x; char z; unsigned long long mod = 1; unsigned long long pommod = 1; LL razy(unsigned long long a,unsigned long long b){ return ((a/pommod * b + b/pommod * a) % pommod * pommod + (a%pommod) * (b%pommod)) % mod; } LL pom[2][2]; struct mac{ LL t[2][2]; mac(){ t[0][0] = t[1][1] = 1; t[0][1] = t[1][0] = 0; } void fib(){ t[0][0] = 0; t[0][1] = t[1][0] = t[1][1] = 1; } void operator*=(mac &x){ R(i,2)R(j,2){ pom[i][j] = razy(t[i][0], x.t[0][j]) + razy(t[i][1], x.t[1][j]); } R(i,2)R(j,2) t[i][j] = pom[i][j]%mod; } void wys(){ R(i,2){ R(j,2)printf("%lld ",(long long)t[i][j]); puts(""); } } }; mac fib(LL w){ mac res,a; a.fib(); while(w){ if(w&1) res*=a; w/=2; a*=a; } return res; } vector<pair<LL,mac> > kan,kan2; main(){ while(1){ scanf("%c",&z); if(z <= '9' && z >= '0'){ n++; if(n&1)pommod*=5; mod *= 5; x *= 10; x += z - '0'; }else break; } LL per = 20; mac pom,ak;pom.fib(); R(i,20){ if(ak.t[0][1] % 5 == x % 5) kan.PB({i,ak}); ak*=pom; } LL akmod = 5; R(i,n-1){ akmod *= 5; for(auto k:kan){ R(j,5){ if((k.SE.t[0][1]-x) % akmod == 0){ kan2.PB(k); } k.SE *= ak; k.FI += per; } } kan.clear(); swap(kan,kan2); mac ak2 = ak; R(i,4)ak *= ak2; per *= 5; } mod = 1<<n; pommod = 1<<((n+1)/2); for(auto &k:kan)k.SE = fib(k.FI); ak = fib(per); akmod = 1; R(i,n){ akmod*=2; int il = (i==0)*2 + (i>2)*1 + 1; for(auto k:kan){ R(j,il){ if((k.SE.t[0][1]-x) % akmod == 0){ kan2.PB(k); } k.SE *= ak; k.FI += per; } } kan.clear(); swap(kan,kan2); mac ak2 = ak; R(i,il-1)ak *= ak2; per *= il; } if(kan.size()){ printf("%lld\n",kan[0].FI + per); }else puts("NIE"); } |