Difference between revisions of "Training 3: FFT and Polynomial"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
Xiejiadong (talk | contribs) |
||
Line 61: | Line 61: | ||
== Problem H == | == Problem H == | ||
− | + | Solved by Xiejiadong. | |
+ | |||
+ | Problem from HDU6061. | ||
+ | |||
+ | NTT。 | ||
+ | |||
+ | [[http://xiejiadong.com/?p=565 题解]] |
Revision as of 15:05, 5 May 2019
Problem A
Solved by Xiejiadong.
Problem from BZOJ4827.
FFT
[题解]
Problem B
Solved by Xiejiadong.
Problem from CF622F.
拉格朗日插值法。
[题解]
Problem C
Solved by Xiejiadong.
Problem form Codeforces1096G.
NTT。
[题解]
Problem D
Unsolved.
Problem E
Unsolved.
Problem F
Solved by Xiejiadong.
Problem from HDU1402.
超大数 $a\times b$ 。
看作多项式乘法,FFT模版题。
注意 $0\times a$ 的情况。
Problem G
Solved by Xiejiadong.
Problem from HDU4609.
FFT。
[题解]
Problem H
Solved by Xiejiadong.
Problem from HDU6061.
NTT。
[题解]