#P3803. 【模板】多项式乘法(FFT)
【模板】多项式乘法(FFT)
Description
Given a degree polynomial and a degree polynomial , compute the product and .
Input Format
The first line contains two integers .
The next line contains integers, representing the coefficients of from lowest degree to highest.
The next line contains integers, representing the coefficients of from lowest degree to highest.
Output Format
Output one line containing integers, representing the coefficients of from lowest degree to highest.
1 2
1 2
1 2 1
1 4 5 2
Hint
It is guaranteed that all input coefficients are integers between and inclusive.
For of the testdata: .
Translated by ChatGPT 5
京公网安备 11011102002149号