read(n);read(m);read(l); rep(i,0,m-1){ read(p[i]); } f[1]=p[0]; rep(i,2,l){ rep(j,0,m-1){ f[i]=(f[i]+p[j]*Quick_Pow(f[i-1],j)%mod)%mod; } } out(Quick_Pow(f[l],n),'\n'); return 0;
本文来自博客园,作者:{2519},转载请注明原文链接:https://www.cnblogs.com/QQ2519/p/15562178.html