bzoj3738 [Ontak2013]Kapitał（扩展Lucas+CRT+欧拉函数）

把末尾0去掉，相当于先除了个$10^x$，$x=min(num[2],num[5])$。
然后就是普通的扩展Lucas+CRT了。详见：portal

以后我要全开ll【再见】，心态爆炸。我大概就是个辣鸡吧qaq

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 2000000
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline ll read(){
    ll x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
ll k2,k5,k,fac[N];int K,m1,m2,P;
inline ll ksm(ll x,ll k,int mod){
    ll res=1;for(;k;k>>=1,x=x*x%mod) if(k&1) res=res*x%mod;return res;
}
inline ll mul(ll n,int pi,int mod){
    if(!n) return 1;
    ll res=ksm(fac[mod],n/mod,mod)*fac[n%mod]%mod;
    return res*mul(n/pi,pi,mod)%mod;
}
inline ll Lucas(ll n,ll m,int pi,int mod){
    int phi=mod-mod/pi;fac[0]=1;
    for(int i=1;i<=mod;++i) if(i%pi) fac[i]=fac[i-1]*i%mod;else fac[i]=fac[i-1];
    ll res=mul(n,pi,mod)*ksm(mul(m,pi,mod),phi-1,mod)%mod*ksm(mul(n-m,pi,mod),phi-1,mod)%mod;
    if(pi==2) res=res*ksm(ksm(5,phi-1,mod),k5,mod)%mod;
    else res=res*ksm(ksm(2,phi-1,mod),k2,mod)%mod;
    res=res*ksm(P,k,mod)%mod;return res;
}
inline ll calc(ll n,ll m,int pi){
    ll res=0;
    for(ll i=pi;i<=n;i*=pi) res+=n/i;
    for(ll i=pi;i<=m;i*=pi) res-=m/i;m=n-m;
    for(ll i=pi;i<=m;i*=pi) res-=m/i;return res;
}
inline void print(int x){
    int xx=x,len=0;while(xx) xx/=10,++len;
    if(!len) ++len;for(int i=1;i<=K-len;++i) putchar('0');
    printf("%d\n",x);
}
int main(){
//  freopen("a.in","r",stdin);
    ll n=read(),m=read();K=read();n+=m;
    int mod=ksm(10,K,1e9+1),m1=ksm(2,K,1e9+1),m2=ksm(5,K,1e9+1);
    k2=calc(n,m,2);k5=calc(n,m,5);
    if(k2>=k5) P=2,k=k2-k5;else P=5,k=k5-k2;
    ll r1=Lucas(n,m,2,m1),r2=Lucas(n,m,5,m2);
    ll res=r1*m2%mod*ksm(m2,m1-m1/2-1,m1)%mod+r2*m1%mod*ksm(m1,m2-m2/5-1,m2)%mod;
    print(res%mod);
    return 0;
}