//Przemysław Jakub Kozłowski #include <iostream> #include <cstdio> #include <algorithm> #include <vector> #define FI first #define SE second #define MP make_pair using namespace std; typedef long long LL; inline pair<LL,LL> operator%(const pair<LL,LL> &A, LL b) {return MP(A.FI%b, A.SE%b);} inline LL mnoz(LL a, LL b, LL mod) { LL ret = 0; while(b) { if(b%2 == 1) ret = (ret+a)%mod; b /= 2; a = (a+a)%mod; } return ret; } struct Skok { LL H[4]; Skok() { H[0] = 0; H[1] = 0; H[2] = 0; H[3] = 0; } Skok(int a, int b, int c, int d) { H[0] = a; H[1] = b; H[2] = c; H[3] = d; } }; Skok polacz(const Skok &A, const Skok &B, LL mod) { Skok C; C.H[0] = (mnoz(A.H[0], B.H[0], mod)+mnoz(A.H[1], B.H[2], mod))%mod; C.H[1] = (mnoz(A.H[0], B.H[1], mod)+mnoz(A.H[1], B.H[3], mod))%mod; C.H[2] = (mnoz(A.H[2], B.H[0], mod)+mnoz(A.H[3], B.H[2], mod))%mod; C.H[3] = (mnoz(A.H[2], B.H[1], mod)+mnoz(A.H[3], B.H[3], mod))%mod; return C; } inline pair<LL, LL> skocz(const Skok &A, pair<LL,LL> w, LL mod) { pair<LL,LL> ret; ret.FI = (mnoz(A.H[0], w.FI, mod)+mnoz(A.H[1], w.SE, mod))%mod; ret.SE = (mnoz(A.H[2], w.FI, mod)+mnoz(A.H[3], w.SE, mod))%mod; return ret; } struct Stan { LL mmod; LL wart; LL cmod; LL dlg_cykl; Skok skok_cykl; vector<pair<LL, pair<LL, LL> > > dobre; // Liczby x z przedziału <1, dlg_cykl>, dla których F_x przystaje do wart (mod cmod) }; Stan pomnoz(const Stan &sstan, LL krok) { Stan nstan; nstan.mmod = sstan.mmod; nstan.wart = sstan.wart; nstan.cmod = sstan.cmod*krok; int ile_skokow = 0; for(int i = 0;i < sstan.dobre.size();i++) { pair<LL,LL> w = sstan.dobre[i].SE; int ile = 0; while(true) { if(nstan.wart%nstan.cmod == w.SE%nstan.cmod) nstan.dobre.push_back(MP(sstan.dobre[i].FI+sstan.dlg_cykl*ile, w)); ile++; w = skocz(sstan.skok_cykl, w, sstan.mmod); if(w%nstan.cmod == sstan.dobre[i].SE%nstan.cmod) break; } ile_skokow = ile; } nstan.dlg_cykl = sstan.dlg_cykl*ile_skokow; nstan.skok_cykl = sstan.skok_cykl; for(int i = 2;i <= ile_skokow;i++) nstan.skok_cykl = polacz(nstan.skok_cykl, sstan.skok_cykl, nstan.mmod); return nstan; } LL obl(LL S, LL mmod, LL krok) { Stan stan; stan.mmod = mmod; stan.wart = S; stan.cmod = 1; stan.dlg_cykl = 1; stan.skok_cykl = Skok(0, 1, 1, 1); stan.dobre.push_back(MP(1, MP(0,1) )); while(stan.mmod != stan.cmod) stan = pomnoz(stan, krok); if(stan.dobre.size()) return stan.dobre[0].FI; else return -1; } int main() { int Sn = 0; LL S = 0; scanf(" "); while(true) { char c = getchar(); if(!('0' <= c && c <= '9')) break; S = S*10+c-'0'; Sn++; } LL mmod = 1; for(int i = 1;i <= Sn;i++) mmod *= 10; LL wyn = obl(S, mmod, 10); const LL MMC = 1500000000000000000LL; if(wyn != -1) printf("%lld\n", wyn+MMC); else 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 139 140 141 142 143 144 145 | //Przemysław Jakub Kozłowski #include <iostream> #include <cstdio> #include <algorithm> #include <vector> #define FI first #define SE second #define MP make_pair using namespace std; typedef long long LL; inline pair<LL,LL> operator%(const pair<LL,LL> &A, LL b) {return MP(A.FI%b, A.SE%b);} inline LL mnoz(LL a, LL b, LL mod) { LL ret = 0; while(b) { if(b%2 == 1) ret = (ret+a)%mod; b /= 2; a = (a+a)%mod; } return ret; } struct Skok { LL H[4]; Skok() { H[0] = 0; H[1] = 0; H[2] = 0; H[3] = 0; } Skok(int a, int b, int c, int d) { H[0] = a; H[1] = b; H[2] = c; H[3] = d; } }; Skok polacz(const Skok &A, const Skok &B, LL mod) { Skok C; C.H[0] = (mnoz(A.H[0], B.H[0], mod)+mnoz(A.H[1], B.H[2], mod))%mod; C.H[1] = (mnoz(A.H[0], B.H[1], mod)+mnoz(A.H[1], B.H[3], mod))%mod; C.H[2] = (mnoz(A.H[2], B.H[0], mod)+mnoz(A.H[3], B.H[2], mod))%mod; C.H[3] = (mnoz(A.H[2], B.H[1], mod)+mnoz(A.H[3], B.H[3], mod))%mod; return C; } inline pair<LL, LL> skocz(const Skok &A, pair<LL,LL> w, LL mod) { pair<LL,LL> ret; ret.FI = (mnoz(A.H[0], w.FI, mod)+mnoz(A.H[1], w.SE, mod))%mod; ret.SE = (mnoz(A.H[2], w.FI, mod)+mnoz(A.H[3], w.SE, mod))%mod; return ret; } struct Stan { LL mmod; LL wart; LL cmod; LL dlg_cykl; Skok skok_cykl; vector<pair<LL, pair<LL, LL> > > dobre; // Liczby x z przedziału <1, dlg_cykl>, dla których F_x przystaje do wart (mod cmod) }; Stan pomnoz(const Stan &sstan, LL krok) { Stan nstan; nstan.mmod = sstan.mmod; nstan.wart = sstan.wart; nstan.cmod = sstan.cmod*krok; int ile_skokow = 0; for(int i = 0;i < sstan.dobre.size();i++) { pair<LL,LL> w = sstan.dobre[i].SE; int ile = 0; while(true) { if(nstan.wart%nstan.cmod == w.SE%nstan.cmod) nstan.dobre.push_back(MP(sstan.dobre[i].FI+sstan.dlg_cykl*ile, w)); ile++; w = skocz(sstan.skok_cykl, w, sstan.mmod); if(w%nstan.cmod == sstan.dobre[i].SE%nstan.cmod) break; } ile_skokow = ile; } nstan.dlg_cykl = sstan.dlg_cykl*ile_skokow; nstan.skok_cykl = sstan.skok_cykl; for(int i = 2;i <= ile_skokow;i++) nstan.skok_cykl = polacz(nstan.skok_cykl, sstan.skok_cykl, nstan.mmod); return nstan; } LL obl(LL S, LL mmod, LL krok) { Stan stan; stan.mmod = mmod; stan.wart = S; stan.cmod = 1; stan.dlg_cykl = 1; stan.skok_cykl = Skok(0, 1, 1, 1); stan.dobre.push_back(MP(1, MP(0,1) )); while(stan.mmod != stan.cmod) stan = pomnoz(stan, krok); if(stan.dobre.size()) return stan.dobre[0].FI; else return -1; } int main() { int Sn = 0; LL S = 0; scanf(" "); while(true) { char c = getchar(); if(!('0' <= c && c <= '9')) break; S = S*10+c-'0'; Sn++; } LL mmod = 1; for(int i = 1;i <= Sn;i++) mmod *= 10; LL wyn = obl(S, mmod, 10); const LL MMC = 1500000000000000000LL; if(wyn != -1) printf("%lld\n", wyn+MMC); else printf("NIE\n"); return 0; } |