Tao God, eternal God! fkami, my superhero!

As a tester, the statements are short and pretests are strong and give me contribution XD

Thank you very much!

Sorry, my English is really poor, it's hard for me to explain it.

let $$$F_z(x)=\sum_{i=0}^{z}\frac{x^i}{i!}$$$, we need to count $$$[x^k]F_z(x)^{n}$$$ for $$$z=0,1,2...k$$$

first, we can count $$$[x^k]F_z(x)^n$$$ in $$$O(k\log k)$$$

the main idea is if we know $$$F_z(x)$$$, we can get $$$[x^k]F_{z+j}(x)$$$ in $$$\mathcal O(j\frac{k^2}{z^2})$$$

to get $$$\mathcal O(\textrm{poly}~k^{\frac{5}{3}})$$$ solution, we need to count $$$F_t(x)^n$$$ for $$$t = 1,2,3...cnt_1$$$, and then count $$$F_{i\cdot cnt_2+cnt1}(x)^n$$$ for each $$$i=0,1,2...\frac{k}{cnt_2}$$$, then use the $$$\mathcal O(j\frac{k^2}{z^2})$$$ algorithm to count this answer for each $$$[x^k]F_{z+j}(x)$$$

we can get an $$$\mathcal O(\textrm{poly}~k^{\frac{5}{3}})$$$ solution by choose right $$$cnt_1,cnt_2$$$

there is one person in our school，he almost can't solve any problem in our school test, but get Master(orange) in codeforces easy.

In China, codeforces Round usually hold in night, in the next daytime, I ask the statement in Chinese of the problem he have passed, he couldn't answer any.

Usually, he even don't know the problem's statement but get the right code.

To protect him, I can't publish his codeforces Id.

sorry for my poor English.

yeah, it's a little hard for me to understand the statement, maybe my English is so pool.

Sorry for my stupid, it's a little hard for me to understand Div1E solution, can someone explain it easily? thanks!

how to solve div1D in $$$O(N)$$$ ?

you can check it, CF1163E, I can't find where to hack it...

we find some one use wrong algorithm to pass it.we try to hack it, but can't find the way.

sorry,my English is pool, so maybe you can't know what I say(sorry

for provincial level,there is a more difficult OI what province made by themselves