Fast Fourier Transform, Algorithms, Pattern Matching, Convolution, Combination Sum.
at x=10. Here is a python code to implement multiplication using the polynomial representation. def get_coefficients(r): coefficients = [] while r > 0: coefficients += [r%10] r = int(r/10) return coefficients def multiply(p, q): sign = (p >= 0 and q >= 0) or (p < 0 and q < 0) p, q = abs(p), abs(q)