結果
問題 | No.891 隣接3項間の漸化式 |
ユーザー | eQe |
提出日時 | 2022-10-06 15:32:37 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 19,826 bytes |
コンパイル時間 | 9,611 ms |
コンパイル使用メモリ | 346,888 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-11 00:36:11 |
合計ジャッジ時間 | 10,482 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 3 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 3 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 3 ms
5,376 KB |
testcase_08 | AC | 3 ms
5,376 KB |
testcase_09 | AC | 3 ms
5,376 KB |
testcase_10 | AC | 3 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 3 ms
5,376 KB |
testcase_13 | AC | 3 ms
5,376 KB |
testcase_14 | AC | 3 ms
5,376 KB |
testcase_15 | AC | 3 ms
5,376 KB |
testcase_16 | AC | 3 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 3 ms
5,376 KB |
testcase_19 | AC | 3 ms
5,376 KB |
testcase_20 | WA | - |
testcase_21 | AC | 3 ms
5,376 KB |
testcase_22 | AC | 3 ms
5,376 KB |
testcase_23 | WA | - |
testcase_24 | AC | 3 ms
5,376 KB |
testcase_25 | AC | 3 ms
5,376 KB |
testcase_26 | AC | 3 ms
5,376 KB |
testcase_27 | AC | 3 ms
5,376 KB |
testcase_28 | AC | 3 ms
5,376 KB |
testcase_29 | AC | 3 ms
5,376 KB |
testcase_30 | AC | 3 ms
5,376 KB |
testcase_31 | AC | 3 ms
5,376 KB |
testcase_32 | AC | 3 ms
5,376 KB |
testcase_33 | AC | 3 ms
5,376 KB |
testcase_34 | AC | 2 ms
5,376 KB |
testcase_35 | AC | 3 ms
5,376 KB |
testcase_36 | AC | 3 ms
5,376 KB |
testcase_37 | AC | 3 ms
5,376 KB |
testcase_38 | AC | 3 ms
5,376 KB |
testcase_39 | AC | 3 ms
5,376 KB |
testcase_40 | AC | 3 ms
5,376 KB |
testcase_41 | AC | 3 ms
5,376 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<atcoder/all> //#include<boost/multiprecision/cpp_int.hpp> #include<bits/stdc++.h> #define bgn(a) begin(a) #define rbg(a) rbegin(a) #define fin(...) exit(pp(__VA_ARGS__)) #define done(...) rr vo(pp(__VA_ARGS__)) #define ep(...) emplace(__VA_ARGS__) #define ef(...) emplace_front(__VA_ARGS__) #define eb(...) emplace_back(__VA_ARGS__) #define pf(...) pop_front(__VA_ARGS__) #define pb(...) pop_back(__VA_ARGS__) #define ei(...) else if(__VA_ARGS__) #define iif if #define el else #define wh(...) while(__VA_ARGS__) #define lb(...) lower_bound(__VA_ARGS__) #define ub(...) upper_bound(__VA_ARGS__) #define itmax(...) max_element(al(__VA_ARGS__)) #define itmin(...) min_element(al(__VA_ARGS__)) #define srt(...) sort(al(__VA_ARGS__)) #define rv(...) reverse(al(__VA_ARGS__)) #define rsr(a) srt(a),rv(a) #define uq(a) srt(a),a.erase(unique(al(a)),end(a)) #define sw(a,b) swap(a,b) #define sb(...) substr(__VA_ARGS__) #define ov3(a,b,c,d,...) d #define ov4(a,b,c,d,e,...) e #define ov5(a,b,c,d,e,f,...) f #define ov6(a,b,c,d,e,f,g,...) g #define al1(v) bgn(v),end(v) #define al2(v,b) bgn(v),bgn(v)+b #define al3(v,a,b) bgn(v)+a,bgn(v)+b #define al(...) ov3(__VA_ARGS__,al3,al2,al1)(__VA_ARGS__) #define fo1(b) for(ll ii=0;ii<(ll)(b);ii++) #define fo2(i,b) for(ll i=0;i<(ll)(b);i++) #define fo3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++) #define fo4(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c)) #define fo(...) ov4(__VA_ARGS__,fo4,fo3,fo2,fo1)(__VA_ARGS__) #define of1(a) fo(a) #define of2(i,a) for(ll i=(ll)(a)-1;i>=0;i--) #define of3(i,a,b) for(ll i=(ll)(a)-1;i>=(ll)(b);i--) #define of4(i,a,b,c) for(ll i=(ll)(a)-1;i>=(ll)(b);i-=(ll)(c)) #define of(...) ov4(__VA_ARGS__,of4,of3,of2,of1)(__VA_ARGS__) #define fe1(a) fo(len(a)) #define fe2(a,v) for(au&&a:v) #define fe3(a,b,v) for(au&&[a,b]:v) #define fe4(a,b,c,v) for(au&&[a,b,c]:v) #define fe5(a,b,c,d,v) for(au&&[a,b,c,d]:v) #define fe(...) ov5(__VA_ARGS__,fe5,fe4,fe3,fe2,fe1)(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;li(__VA_ARGS__) #define DD(...) dd __VA_ARGS__;li(__VA_ARGS__) #define ST(...) str __VA_ARGS__;li(__VA_ARGS__) #define MI(...) mint __VA_ARGS__;li(__VA_ARGS__) #define UL2(n,a) u1 a(n);li(a) #define UL3(n,a,b) u1 a(n),b(n);li(a,b) #define UL4(n,a,b,c) u1 a(n),b(n),c(n);li(a,b,c) #define UL5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);li(a,b,c,d) #define UL6(n,a,b,c,d,e) u1 a(n),b(n),c(n),d(n),e(n);li(a,b,c,d,e) #define UL(...) ov6(__VA_ARGS__,UL6,UL5,UL4,UL3,UL2)(__VA_ARGS__) #define UV2(n,a) u1 a(n);vi(a) #define UV3(n,a,b) u1 a(n),b(n);vi(a,b) #define UV4(n,a,b,c) u1 a(n),b(n),c(n);vi(a,b,c) #define UV5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);vi(a,b,c,d) #define UV6(n,a,b,c,d,e) u1 a(n),b(n),c(n),d(n),e(n);vi(a,b,c,d,e) #define UV(...) ov6(__VA_ARGS__,UV6,UV5,UV4,UV3,UV2)(__VA_ARGS__) #define DL2(n,a) v1<dd>a(n);li(a) #define DL3(n,a,b) v1<dd>a(n),b(n);li(a,b) #define DL4(n,a,b,c) v1<dd>a(n),b(n),c(n);li(a,b,c) #define DL5(n,a,b,c,d) v1<dd>a(n),b(n),c(n),d(n);li(a,b,c,d) #define DL(...) ov5(__VA_ARGS__,DL5,DL4,DL3,DL2)(__VA_ARGS__) #define DV2(n,a) v1<dd>a(n);vi(a) #define DV3(n,a,b) v1<dd>a(n),b(n);vi(a,b) #define DV4(n,a,b,c) v1<dd>a(n),b(n),c(n);vi(a,b,c) #define DV5(n,a,b,c,d) v1<dd>a(n),b(n),c(n),d(n);vi(a,b,c,d) #define DV(...) ov5(__VA_ARGS__,DV5,DV4,DV3,DV2)(__VA_ARGS__) #define U23(h,w,a) u2 a;rs(a,h,w);li(a) #define U24(h,w,a,b) u2 a,b;rs(a,h,w),rs(b,h,w);li(a,b) #define U25(h,w,a,b,c) u2 a,b,c;rs(a,h,w),rs(b,h,w),rs(c,h,w);li(a,b,c) #define U2(...) ov5(__VA_ARGS__,U25,U24,U23)(__VA_ARGS__) #define S22(h,a) strs a(h);li(a) #define S23(h,a,b) strs a(h),b(h);li(a,b) #define S2(...) ov3(__VA_ARGS__,S23,S22)(__VA_ARGS__) #define AND2(a,b) ((a)&&(b)) #define AND3(a,b,c) ((a)&&(b)&&(c)) #define AND4(a,b,c,d) ((a)&&(b)&&(c)&&(d)) #define AND5(a,b,c,d,e) ((a)&&(b)&&(c)&&(d)&&(e)) #define AND6(a,b,c,d,e,f) ((a)&&(b)&&(c)&&(d)&&(e)&&(f)) #define AND(...) ov6(__VA_ARGS__,AND6,AND5,AND4,AND3,AND2)(__VA_ARGS__) #define OR2(a,b) ((a)||(b)) #define OR3(a,b,c) ((a)||(b)||(c)) #define OR4(a,b,c,d) ((a)||(b)||(c)||(d)) #define OR5(a,b,c,d,e) ((a)||(b)||(c)||(d)||(e)) #define OR6(a,b,c,d,e,f) ((a)||(b)||(c)||(d)||(e)||(f)) #define OR(...) ov6(__VA_ARGS__,OR6,OR5,OR4,OR3,OR2)(__VA_ARGS__) #define I template #define J class #define O operator #define rr return #define ss struct #define uu using #define as assert #define au auto #define bk break #define cs const #define ct continue #define endl "\n" #define fd friend #define sc static #define th this namespace my{ uu vo=void; vo main(); vo solve(); } int main(){my::main();} namespace my{ uu namespace std; uu namespace atcoder; //uu namespace boost::multiprecision; uu mint=modint1000000007; //uu cint=cpp_int; uu ll=long long; uu dd=long double; uu ui=unsigned int; uu ul=unsigned long long; uu chr=char; uu str=string; uu bo=bool; uu is=istream; uu os=ostream; str sp=" ",nc="",nl="\n"; au np=nullptr; I<J A,J B>ss cp{ A a;B b; cp():a(A()),b(B()){} cp(A a,B b):a(a),b(b){} cp O+()cs{rr*th;} cp O-()cs{rr cp(-a,-b);} cp&O++(){a++,b++;rr*th;}cp O++(int){cp r=*th;++*th;rr r;} cp&O--(){a--,b--;rr*th;}cp O--(int){cp r=*th;--*th;rr r;} cp&O+=(cs cp&c){a+=c.a;b+=c.b;rr*th;}cp O+(cs cp&c)cs{rr cp(*th)+=c;} cp&O-=(cs cp&c){a-=c.a;b-=c.b;rr*th;}cp O-(cs cp&c)cs{rr cp(*th)-=c;} cp&O*=(cs cp&c){a*=c.a;b*=c.b;rr*th;}cp O*(cs cp&c)cs{rr cp(*th)*=c;} I<J D>cp&O+=(cs D&d){a+=d;b+=d;rr*th;}I<J D>cp O+(cs D&d)cs{rr cp(*th)+=d;} I<J D>cp&O-=(cs D&d){a-=d;b-=d;rr*th;}I<J D>cp O-(cs D&d)cs{rr cp(*th)-=d;} I<J D>cp&O*=(cs D&d){a*=d;b*=d;rr*th;}I<J D>cp O*(cs D&d)cs{rr cp(*th)*=d;} bo O==(cs cp&c)cs{rr AND(a==c.a,b==c.b);}bo O!=(cs cp&c)cs{rr!(*th==c);} bo O<(cs cp&c)cs{rr a!=c.a?a<c.a:b<c.b;}bo O>=(cs cp&c)cs{rr!(*th<c);} bo O>(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}bo O<=(cs cp&c)cs{rr!(*th>c);} fd is&O>>(is&i,cp&c){rr i>>c.a>>c.b;} fd os&O<<(os&o,cs cp&c){rr o<<c.a<<sp<<c.b;} }; I<J A,J B,J C>ss tr{ A a;B b;C c; tr():a(A()),b(B()),c(C()){} tr(A a,B b,C c):a(a),b(b),c(c){} bo O==(cs tr&t)cs{rr AND(a==t.a,b==t.b,c==t.c);} bo O!=(cs tr&t)cs{rr!(*th==t);} bo O<(cs tr&t)cs{rr a!=t.a?a<t.a:b!=t.b?b<t.b:c<t.c;} bo O>(cs tr&t)cs{rr a!=t.a?a>t.a:b!=t.b?b>t.b:c>t.c;} fd is&O>>(is&i,tr&t){rr i>>t.a>>t.b>>t.c;} fd os&O<<(os&o,cs tr&t){rr o<<t.a<<sp<<t.b<<sp<<t.c;} }; I<J A,J B,J C,J D>ss qu{ A a;B b;C c;D d; qu():a(A()),b(B()),c(C()),d(D()){} qu(A a,B b,C c,D d):a(a),b(b),c(c),d(d){} bo O==(cs qu&q)cs{rr AND(a==q.a,b==q.b,c==q.c,d==q.d);} bo O!=(cs qu&q)cs{rr!(*th==q);} bo O<(cs qu&q)cs{rr a!=q.a?a<q.a:b!=q.b?b<q.b:c!=q.c?c<q.c:d<q.d;} bo O>(cs qu&q)cs{rr a!=q.a?a>q.a:b!=q.b?b>q.b:c!=q.c?c>q.c:d>q.d;} fd is&O>>(is&i,qu&q){rr i>>q.a>>q.b>>q.c>>q.d;} fd os&O<<(os&o,cs qu&q){rr o<<q.a<<sp<<q.b<<sp<<q.c<<sp<<q.d;} }; I<J T>uu v1=vector<T>;uu u1=v1<ll>; I<J T>uu v2=v1<v1<T>>;uu u2=v1<u1>; I<J T>uu v3=v1<v2<T>>;uu u3=v1<u2>; I<J T>uu v4=v1<v3<T>>;uu u4=v1<u3>; I<J T>uu mset=multiset<T>; I<J T>uu fn=function<T>; I<J T>uu pqmax=priority_queue<T>; I<J T>uu pqmin=priority_queue<T,v1<T>,greater<T>>; uu strs=v1<str>; uu cl=cp<ll,ll>; uu cd=cp<dd,dd>; uu tl=tr<ll,ll,ll>; uu ql=deque<ll>; uu sl=set<ll>; uu msl=mset<ll>; uu ml=map<ll,ll>; ss edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}}; uu graph=v2<edg>; ll inf=3e18; dd ee=1e-10,pi=acosl(-1); u1 dx={-1,0,1,0,-1,1,1,-1},dy={0,-1,0,1,-1,-1,1,1}; str first(bo t=1){rr t?"first":"second";} str First(bo t=1){rr t?"First":"Second";} str yes(bo t=1){rr t?"yes":"no";}str no(){rr yes(0);} str Yes(bo t=1){rr t?"Yes":"No";}str No(){rr Yes(0);} str YES(bo t=1){rr t?"YES":"NO";}str NO(){rr YES(0);} str possible(bo t=1){rr t?"possible":"impossible";} str Possible(bo t=1){rr t?"Possible":"Impossible";} str POSSIBLE(bo t=1){rr t?"POSSIBLE":"IMPOSSIBLE";} ui rnd(){ sc ui x=123456789,y=362436069,z=521288629,w=88675123; ui t=(x^(x<<11));x=y,y=z,z=w; rr(w=(w^(w>>19))^(t^(t>>8))); } dd rnd_prb(){rr (dd)rnd()/UINT_MAX;} ll rnd_rng(ll r){rr rnd()%r;} ll rnd_rng(ll l,ll r){rr rnd()%(r-l)+l;} bo od(ll x){rr x&1;} bo ev(ll x){rr !od(x);} bo parity(ll x,ll y){rr ev(x-y);} ll bit(ll a){rr 1LL<<a;} ll ppc(ll a){rr __builtin_popcountll(a);} ll sqr(ll x){if(x<=1)rr x;ll r=sqrtl(x)-1;wh(r+1<=x/(r+1))r++;rr r;} ll lg2(ll n){ll r=0;wh(n){n/=2;r++;}rr r;} ll lg10(ll n){ll r=0;wh(n)n/=10,r++;rr r;} bo in(ll a,ll x,ll b){rr a<=x&&x<b;}//x in [a,b) u1 sub(ll S){u1 r;for(ll b=S;b>0;--b&=S)r.eb(b);srt(r);rr r;} I<J T,J U,J V>au sum(T a,U d,V n){rr n*(a*2+(n-1)*d)/2;} I<J T>ll len(cs T&a){rr a.size();} I<J T>bo yu(cs T&a){rr len(a);} I<J T>bo mu(cs T&a){rr !yu(a);} I<J T>T sq(T a){rr a*a;} I<J T>T ab(T a){rr abs(a);} ll at(ll S,ll i){rr S>>i&1;} I<J T>T at(cs v1<T>&v,ll i){ll n=len(v);rr v[(i%n+n)%n];} I<J T>ll sgn(cs T&a){rr(a>ee)-(a<-ee);} I<J T,J U>ll sgn(cs T&a,cs U&b){rr sgn(a-b);} I<J T,J U>T cei(T x,U y){as(y);rr(y<0?cei(-x,-y):(x>0?(x+y-1)/y:x/y));} I<J T,J U>T flo(T x,U y){as(y);rr(y<0?flo(-x,-y):(x>0?x/y:x/y-!(x%y)));} str tos(cs chr&a){rr a+nc;} str tos(cs chr*a){rr a;} str tos(cs str&a){rr a;} I<J T>str tos(cs T&a){rr to_string(a);} I<J T,J...A>str tos(cs T&a,cs A&...b){rr tos(a)+tos(b...);} u1 tou(cs str&s,chr b='a'){u1 a;fe(c,s)a.eb(c-b);rr a;} u2 tou(cs strs&s,chr b='a'){u2 a;fe(t,s)a.eb(tou(t,b));rr a;} u1 tou(cs str&s,cs str&t){ ll n=len(s); u1 a(n); fo(i,n)fo(j,len(t))if(s[i]==t[j]){a[i]=j;bk;} rr a; } u2 tou(cs strs&s,cs str&t){ll h=len(s);u2 a(h);fo(i,h)a[i]=tou(s[i],t);rr a;} u1 tou(cs v1<chr>&b,cs str&t){ ll n=len(b); u1 a(n); fo(i,n)fo(j,len(t))if(b[i]==t[j]){a[i]=j;bk;} rr a; } u2 tou(cs graph&g){ll n=len(g);u2 a(n);fo(u,n)fe(v,w,g[u])a[u].eb(v);rr a;} graph tog(cs u2&a){ll n=len(a);graph g(n);fo(u,n)fe(v,a[u])g[u].eb(v);rr g;} u1 rp(cs u1&a,ll x=inf,ll y=-1){u1 b=a;fo(i,len(a))if(a[i]==x)b[i]=y;rr b;} I<J T>au O+(v1<T>v){rr v;} I<J T>au O-(v1<T>v){fe(x,v)x=-x;rr v;} I<J T>au&O++(v1<T>&v){fe(x,v)x++;rr v;} I<J T>au&O--(v1<T>&v){fe(x,v)x--;rr v;} I<J T>au O++(v1<T>&v,int){au r=v;++v;rr r;} I<J T>au O--(v1<T>&v,int){au r=v;--v;rr r;} I<J T>au&O+=(v1<T>&v,cs v1<T>&u){fo(i,len(v))v[i]+=u[i];rr v;} I<J T>au&O-=(v1<T>&v,cs v1<T>&u){fo(i,len(v))v[i]-=u[i];rr v;} I<J T>au&O*=(v1<T>&v,cs v1<T>&u){fo(i,len(v))v[i]*=u[i];rr v;} I<J T>au O+(v1<T>v,cs v1<T>&u){rr v+=u;} I<J T>au O-(v1<T>v,cs v1<T>&u){rr v-=u;} I<J T>au O*(v1<T>v,cs v1<T>&u){rr v*=u;} I<J T>au&O^=(v1<T>&v,cs v1<T>&u){copy(al(u),back_inserter(v));rr v;} I<J T>au O^(v1<T>v,cs v1<T>&u){rr v^=u;} I<J T,J U>au&O+=(v1<T>&v,cs U&a){fe(x,v)x+=a;rr v;} I<J T,J U>au&O-=(v1<T>&v,cs U&a){fe(x,v)x-=a;rr v;} I<J T,J U>au&O*=(v1<T>&v,cs U&a){fe(x,v)x*=a;rr v;} I<J T,J U>au&O/=(v1<T>&v,cs U&a){fe(x,v)x/=a;rr v;} I<J T,J U>au&O%=(v1<T>&v,cs U&a){fe(x,v)x%=a;rr v;} I<J T,J U>au O+(v1<T>v,cs U&a){rr v+=a;} I<J T,J U>au O-(v1<T>v,cs U&a){rr v-=a;} I<J T,J U>au O*(v1<T>v,cs U&a){rr v*=a;} I<J T,J U>au O/(v1<T>v,cs U&a){rr v/=a;} I<J T,J U>au O%(v1<T>v,cs U&a){rr v%=a;} I<J T,J U>bo amax(T&a,cs U&b){rr a<b?a=b,1:0;} I<J T,J U>bo amin(T&a,cs U&b){rr a>b?a=b,1:0;} I<J T>T max(cs v1<T>&a){rr *itmax(a);} I<J T>T min(cs v1<T>&a){rr *itmin(a);} I<J T>au max(cs v2<T>&a){rr max(*itmax(a));} I<J T>au min(cs v2<T>&a){rr min(*itmin(a));} I<J...T>au max(T...a){rr max(initializer_list<common_type_t<T...>>{a...});} I<J...T>au min(T...a){rr min(initializer_list<common_type_t<T...>>{a...});} ll mex(cs sl&s){ll r=0;wh(s.count(r))r++;rr r;} I<J...T>ll mex(cs T&...a){sl s;fe(x,{a...})s.insert(x);rr mex(s);} I<J T>ll argmax(cs v1<T>&a){rr itmax(a)-bgn(a);} I<J T>ll argmin(cs v1<T>&a){rr itmin(a)-bgn(a);} I<J T,J U>au gcd(cs T&a,cs U&b){rr std::gcd(a,b);} I<J T,J...A>au gcd(cs T&a,cs A&...b){rr gcd(a,gcd(b...));} I<J T>T sum(cs set<T>&s){T r=T();fe(x,s)r+=x;rr r;} I<J T>T sum(cs v1<T>&a){rr accumulate(al(a),T());} I<J T,J U>ll lbs(cs v1<T>&a,cs U&b){rr lb(al(a),b)-bgn(a);} I<J T,J U>ll ubs(cs v1<T>&a,cs U&b){rr ub(al(a),b)-bgn(a);} I<J T,J U>au minmax(cs T&a,cs U&b){rr cp(min(a,b),max(a,b));} I<J T,J U>au minmax(cs cp<T,U>&p){rr minmax(p.a,p.b);} I<J X,J Y>au mp(cs fn<Y(X)>&f,v1<X>x){v1<Y>y;fe(a,x)y.eb(f(a));rr y;} I<J T,J U>au keys(cs map<T,U>&m){v1<T>r;fe(k,v,m)r.eb(k);rr r;} I<J T,J U>au vals(cs map<T,U>&m){v1<U>r;fe(k,v,m)r.eb(v);rr r;} u1 io(ll n,ll a=0){u1 i(n);iota(al(i),a);rr i;} I<J T,J U>vo emplace_front(v1<T>&v,U x=U()){v.ep(bgn(v),x);} I<J T>vo emplace_front(v1<T>&v,T x=T()){v.ep(bgn(v),x);} I<J T>vo pop_front(v1<T>&v){v.erase(bgn(v));} I<J T>au&bg(T&a){rr*bgn(a);} I<J T>au&bg(cs T&a){rr*bgn(a);} I<J T>au&rb(T&a){rr*rbg(a);} I<J T>au&rb(cs T&a){rr*rbg(a);} I<J T>T bg(pqmax<T>&q){rr q.top();} I<J T>T bg(pqmin<T>&q){rr q.top();} I<J T>T pop(v1<T>&v){T r=rb(v);v.pb();rr r;} I<J T>T pop_front(deque<T>&q){T r=bg(q);q.pf();rr r;} I<J T>T pop_back(deque<T>&q){T r=rb(q);q.pb();rr r;} I<J T>T pop(deque<T>&q){rr pop_front(q);} I<J T>T pop(pqmax<T>&q){T r=bg(q);q.pop();rr r;} I<J T>T pop(pqmin<T>&q){T r=bg(q);q.pop();rr r;} ss z{z(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(10);}}z; is&O>>(is&i,mint&x){ll t;i>>t;x=t;rr i;} os&O<<(os&o,cs mint&x){rr o<<x.val();} I<J T,J U>is&O>>(is&i,pair<T,U>&p){rr i>>p.first>>p.second;} I<J T,J U>os&O<<(os&o,cs pair<T,U>&p){rr o<<p.first<<sp<<p.second;} I<J T,J U>os&O<<(os&o,cs map<T,U>&m){fe(p,m)o<<p<<(&p==&rb(m)?nc:nl);rr o;} I<J T>os&O<<(os&o,cs set<T>&s){fe(x,s)o<<x<<sp;rr o;} I<J T>os&O<<(os&o,cs mset<T>&s){fe(x,s)o<<x<<sp;rr o;} I<J T>os&O<<(os&o,deque<T>q){wh(yu(q))o<<pop(q)<<sp;rr o;} I<J T>os&O<<(os&o,pqmax<T>q){wh(yu(q))o<<pop(q)<<sp;rr o;} I<J T>os&O<<(os&o,pqmin<T>q){wh(yu(q))o<<pop(q)<<sp;rr o;} I<J T>is&O>>(is&i,v1<T>&v){fe(x,v)i>>x;rr i;} I<J T>os&O<<(os&o,cs v1<T>&v){fe(x,v)o<<x<<(&x==&rb(v)?nc:sp);rr o;} I<J T>os&O<<(os&o,cs v2<T>&v){fe(x,v)o<<x<<(&x==&rb(v)?nc:nl);rr o;} ll pp(){cout<<endl;rr 0;} I<J T,J...A>ll pp(cs T&a,cs A&...b){cout<<a;((cout<<sp<<b),...);rr pp();} I<J...T>ll li(T&...a){(cin>>...>>a);rr 0;} I<J...T>vo vi(ll i,T&...a){(cin>>...>>a[i]);} I<J T,J...A>vo vi(v1<T>&a,A&...b){fo(i,len(a))vi(i,a,b...);} I<J T>vo rs(v1<T>&v,ll n){v.resize(n);} I<J T,J...A>vo rs(v1<T>&V,ll n,cs A&...a){rs(V,n);fe(v,V)rs(v,a...);} I<J T,J U>vo fl(T&x,cs U&a){x=a;} I<J T,J U>vo fl(v1<T>&V,cs U&a){fe(v,V)fl(v,a);} au gi(u2&g,ll m,bo d=1){ u1 a(m),b(m); fo(i,m){ li(a[i],b[i]);a[i]--,b[i]--; g[a[i]].eb(b[i]); if(d)g[b[i]].eb(a[i]); } rr cp(a,b); } au gi(graph&g,ll m,bo w=1,bo d=1){ u1 a(m),b(m),c(m); fo(i,m){ li(a[i],b[i]);a[i]--,b[i]--; c[i]=1;if(w)li(c[i]); g[a[i]].eb(b[i],c[i]); if(d)g[b[i]].eb(a[i],c[i]); } rr tr(a,b,c); } au ti(u2&g,bo d=1){rr gi(g,len(g)-1,d);} au ti(graph&g,bo w=1,bo d=1){rr gi(g,len(g)-1,w,d);} I<J F>ss rcl:private F{ explicit rcl(F&&f):F(forward<F>(f)){} I<J...T>decltype(au)O()(T&&...a)cs{rr F::O()(*th,forward<T>(a)...);} }; vo pz(cs u1&v,u1&h){fe(x,h)x=lbs(v,x);} I<J...T>vo pz(cs u1&v,u1&h,T&...t){pz(v,h);pz(v,t...);} I<J...T>u1 zp(T&...a){u1 v;fe(e,{a...})v^=e;uq(v);pz(v,a...);rr v;} I<J T>vo sv(cs u1&o,v1<T>&a){au c=a;fo(i,len(a))a[i]=c[o[i]];} I<J T,J...A>vo sv(cs u1&o,v1<T>&a,A&...b){sv(o,a);sv(o,b...);} I<J T,J...A>au vs(cs fn<bo(ll,ll)>&f,v1<T>&a,A&...b){ ll n=len(a); u1 o=io(n),p(n); sort(al(o),f); fo(i,n)p[o[i]]=i; sv(o,a);sv(o,b...); rr cp(o,p); } ll bsl(cs fn<bo(ll)>&j,ll o,ll n){wh(ab(o-n)>1)(j((o+n)/2)?o:n)=(o+n)/2;rr o;} dd bsd(cs fn<bo(dd)>&j,dd o,dd n){wh(ab(o-n)>ee)(j((o+n)/2)?o:n)=(o+n)/2;rr o;} I<J T>au zt(v1<T>a){fo(i,1,len(a))a[i]+=a[i-1];rr a;} I<J T>au mb(v1<T>a){of(i,len(a),1)a[i]-=a[i-1];rr a;} I<J T>au zt(v2<T>a){fe(v,a)v=zt(v);fo(i,1,len(a))a[i]+=a[i-1];rr a;} I<J T>au mb(v2<T>a){fe(v,a)v=mb(v);of(i,len(a),1)a[i]-=a[i-1];rr a;} au rle(u1 a){v1<cl>r;fe(x,a)yu(r)&&x==rb(r).a?rb(r).b++,0:(r.eb(x,1),0);rr r;} au rce(u1 a){v1<cl>r;ml m;fe(x,a)m[x]++;fe(k,v,m)r.eb(k,v);rr r;} I<J T>T esq(T x,ll n,T e){wh(n){if(n&1)e*=x;x*=x;n/=2;}rr e;} vo wafl(u2&d){ll n=len(d);fo(k,n)fo(i,n)fo(j,n)amin(d[i][j],d[i][k]+d[k][j]);} u1 divs(ll n){ml m;fo(i,1,n/i+1)if(n%i==0)m[i]++,m[n/i]++;rr keys(m);} ml fact(ll n){ml m;fo(i,2,n/i+1)wh(n%i==0)m[i]++,n/=i;if(n>1)m[n]++;rr m;} ll inv(ll a,ll m){ a=(a%m+m)%m; ll b=m,u=1,v=0; wh(b)u-=a/b*v,sw(u,v),a-=a/b*b,sw(a,b); rr(u%m+m)%m; } ll pow(ll x,ll n,ll m=inf){ if(n<0)n=-n,x=inv(x,m); ll r=1;wh(n){if(n&1)r*=x,r%=m;x*=x,x%=m,n/=2;}rr r; } I<J T>ss tww{ v1<T>fa,rf,bs; v2<T>m; v2<bo>u; tww(ll n){ n++; rs(fa,n);rs(rf,n);rs(bs,n); fa[0]=rf[0]=bs[0]=1; fo(i,1,n)fa[i]=fa[i-1]*i,rf[i]=rf[i-1]/i; fo(i,1,n)bs[i]=bs[i-1]+rf[i]*pow(-1,i&1); if(n<=5000)rs(m,n,n),rs(u,n,n); } T c(ll n,ll k){rr n==k?1:OR(n<k,n<0,k<0)?0:fa[n]*rf[k]*rf[n-k];} T p(ll n,ll k){rr c(n,k)*fa[k];} T h(ll n,ll r){rr c(n+r-1,r);}//n種類の選択肢から重複を許してr個選ぶ. T s(ll n,ll k){T r=0;fo(i,k+1)r+=c(k,i)*T(i).pow(n)*pow(-1,k-i);rr r*rf[k];} T b(ll n,ll k){T r=0;fo(i,k+1)r+=T(i).pow(n)*rf[i]*bs[k-i];rr r;} T par(ll n,ll k){//自然数nをk個の0以上の整数に分割する if(AND(n==0,k==0))rr 1; if(k==0)rr 0; if(u[n][k])rr m[n][k]; if(n-k>=0)rr u[n][k]=1,m[n][k]=p(n,k-1)+p(n-k,k); rr u[n][k]=1,m[n][k]=p(n,k-1); } }; ss ufin{ ll n; u1 d; ufin():n(0){} ufin(ll n):n(n),d(n,-1){} ll ldr(ll a){as(AND(0<=a,a<n));if(d[a]<0)rr a;rr d[a]=ldr(d[a]);} bo same(ll a,ll b){as(AND(0<=a,a<n,0<=b,b<n));rr ldr(a)==ldr(b);} ll size(ll a){as(AND(0<=a,a<n));rr-d[ldr(a)];} ll mrg(ll a,ll b){ as(AND(0<=a,a<n,0<=b,b<n)); ll x=ldr(a),y=ldr(b); if(x==y)rr x; if(-d[x]<-d[y])sw(x,y); d[x]+=d[y]; d[y]=x; rr x; } u2 groups(){ u1 l(n);u2 g(n); fo(i,n)l[i]=ldr(i);fo(i,n)g[l[i]].eb(i);fo(i,n)srt(g[i]);srt(g); g.erase(remove_if(al(g),[&](cs u1&v){rr mu(v);}),end(g)); rr g; } }; I<J S,cs fn<S(S,S)>&op,cs fn<S()>&e>ss sgt{ ll n,A,log; v1<S>d; sgt(ll n):sgt(v1<S>(n,e())){} sgt(cs v1<S>&v):n(len(v)){ log=lg2(n*2-1)-1; A=bit(log); d=v1<S>(A*2,e()); fo(i,n)d[i+A]=v[i]; of(i,A,1)upd(i); } ll size()cs{rr n;} vo upd(ll k){d[k]=op(d[k*2],d[k*2+1]);} vo set(ll i,S x){as(in(0,i,n));i+=A;d[i]=x;fo(j,1,log+1)upd(i>>j);} vo add(ll i,S x){set(i,get(i)+x);} S get(ll i)cs{as(in(0,i,n));rr d[i+A];} S aprd(){rr d[1];} S prd(ll l,ll r){ as(AND(0<=l,l<=r,r<=n)); S sml=e(),smr=e(); l+=A,r+=A; wh(l<r){if(od(l))sml=op(sml,d[l++]);if(od(r))smr=op(d[--r],smr);l/=2,r/=2;} rr op(sml,smr); } fd os&O<<(os&o,cs sgt&s){fo(i,len(s))o<<s.get(i)<<sp;rr o;} }; I<J T>ss mat{ v2<T>m; ll h,w; mat(ll n):h(n),w(n){rs(m,n,n);} mat(ll h,ll w):h(h),w(w){rs(m,h,w);} mat(ll h,ll w,T x):h(h),w(w){rs(m,h,w);fl(m,x);} mat(v2<T>a):h(len(a)),w(len(bg(a))),m(a){} v1<T>O[](cs ll&i)cs{rr m[i];} v1<T>&O[](cs ll&i){rr m[i];} mat&O+=(cs mat&a){as(h==a.h&&w==a.w);fo(i,h)m[i]+=a[i];rr*th;} mat&O-=(cs mat&a){as(h==a.h&&w==a.w);fo(i,h)m[i]-=a[i];rr*th;} mat&O*=(cs mat&a){ as(w==a.h); mat r(h,a.w); fo(i,h)fo(k,w)fo(j,a.w)r[i][j]+=m[i][k]*a[k][j]; rr*th=r; } //行列 mat O+(cs mat&a)cs{rr mat(*th)+=a;} mat O-(cs mat&a)cs{rr mat(*th)-=a;} mat O*(cs mat&a)cs{rr mat(*th)*=a;} bo O==(cs mat&a){rr m==a.m;} //スカラ mat&O+=(cs T&a){fe(v,m)v+=a;rr*th;}mat O+(cs T&a)cs{rr mat(*th)+=a;} mat&O-=(cs T&a){fe(v,m)v-=a;rr*th;}mat O-(cs T&a)cs{rr mat(*th)-=a;} mat&O*=(cs T&a){fe(v,m)v*=a;rr*th;}mat O*(cs T&a)cs{rr mat(*th)*=a;} mat&O/=(cs T&a){fe(v,m)v/=a;rr*th;}mat O/(cs T&a)cs{rr mat(*th)/=a;} mat pow(ll n){mat x=*th;mat r(h);fo(i,h)r[i][i]=1;rr esq(x,n,r);} vo trs(){mat r(w,h);fo(i,h)fo(j,w)r[j][i]=m[i][j];*th=r;} fd is&O>>(is&i,mat&m){rr i>>m.m;} fd os&O<<(os&o,cs mat&m){rr o<<m.m;} }; vo main(){ ll T=1; //li(T); fo(T)solve(); } vo solve(){ MI(a,b); LL(N); mat<mint>A({{a,b},{1,0}}); A=A.pow(N-1); pp(A[0][0]); }}