StrideTG的博客

Time Limit: 5000MS Memory Limit: 65536K Description Given a prime P, 2 <= P < 231, an integer B, 2 <= B < P, and an integer N, 1 <= N < P, compute the discrete loga...

Time Limit: 5000MS Memory Limit: 65536K Description Little Y finds there is a very interesting formula in mathematics: X^Y mod Z = K Given X, Y, Z, we all know how to figure ou...

时间限制 : 3000 MS 空间限制 :64MB 样例输入 3 2 2 1 2 3 0 1 样例输出 1 4 8 题解 NTT板题，只需用卷积的套路稍微转化一下…… 每出现一个元素ccc，便对多项式gc++gc++g_c++即可。对fff进行kkk次变换，即对fff乘上ggg的kkk次方，用快速幂解决即可。需要注意的是，每次多项式...