WC2019 数树

FFT NTT小结

一个问题

给定$a_i,b_i$,定义$c_n=\sum_{i=0}^n a_ib_{n-i}$,求$c$序列。

AGC005

AGC004

AGC003

AGC002

AGC001F

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×