\(Ans=\frac{\sum\limits_{i=0}^ni^k(m-1)^{n-i}\binom ni}{m^k}\)
\(F(x)=\sum\limits_{t\ge0}\frac{x^t}{t!}\sum\limits_{i=0}^ni^t\binom ni(m-1)^{n-i}\)
\(=\sum\limits_{i=0}^n\binom ni(m-1)^{n-i}e^{ix}\)
\(=(e^x+m-1)^n\)
\(现在求[x^k]F(x),我们试用EI介绍的方法进行处理:\)
\(看成复合形态G(e^x),G(x)=(x+m-1)^n\)
\(注意G(e^k)=G((e^k-1)+1)\)
\(考虑H(x)=G(x+1)=(x+m)^n\)
\(nH(x)=(x+m)H'(x)\)
\(nH_i=iH_i+m(i+1)H_{i+1}\)
\(m(i+1)H_{i+1}+(i-n)H_i=0\)
\(而Q(x)=H(x)\%x^{n+1}\)
\(那么m(i+1)Q_{i+1}+(i-n)Q_i=[i==k](k-n)Q_k\)
\(Q'(x)(x+m)-Q(x)=(k-n)m^{n-k}\binom nkx^k\)
\(令P(x)=Q(x-1)\)
\(P'(x)(x+m-1)-P(x)=(k-n)m^{n-k}\binom nk(x-1)^k\)
\(解出P之后就容易做了\)
相关文章
- 11-22Card Game Cheater HDU1528
- 11-22Codeforces 388C Fox and Card Game (贪心博弈)
- 11-22bzoj4391 [Usaco2015 dec]High Card Low Card
- 11-22[Swift通天遁地]九、拔剑吧-(16)搭建卡片页面:Card Peek/Pop动态切换界面
- 11-22SPOJ 4053 - Card Sorting 最长不下降子序列
- 11-22@atcoder - Japanese Student Championship 2019 Qualification - E@ Card Collector
- 11-22如何使用card.io android SDK获取人类可读格式的完整卡号?
- 11-22hdu4336 Card Collector
- 11-22card-组件布局
- 11-22凤凰之谜卡背 new card back "secrets of the phoenix"