Difference between revisions of "Training 3: FFT and Polynomial"

From EOJ Wiki
Jump to navigation Jump to search
Line 27: Line 27:
 
NTT。
 
NTT。
  
[[题解]]
+
[[http://xiejiadong.com/?p=560 题解]]
  
 
== Problem D ==
 
== Problem D ==

Revision as of 13:17, 4 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

Unsolved.

Problem H

Unsolved.