I am trying to build myself a struct polynomial and some operations on it. I have built and test successfully for inv(F) and ln(F) but somehow the exponent failed horribly. Can someone help me with that .
Thanks.
# | User | Rating |
---|---|---|
1 | jiangly | 3845 |
2 | tourist | 3798 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3589 |
6 | Ormlis | 3532 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | Um_nik | 3450 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | Qingyu | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 157 |
5 | Dominater069 | 156 |
6 | adamant | 154 |
7 | djm03178 | 151 |
8 | luogu_official | 149 |
9 | awoo | 147 |
10 | TheScrasse | 145 |
I am trying to build myself a struct polynomial and some operations on it. I have built and test successfully for inv(F) and ln(F) but somehow the exponent failed horribly. Can someone help me with that .
Thanks.
Currently I am learning about generating functions and some problems of this type requires polynomials operation such as multiplication and exponents. But I cannot figure out what template to use. There are some templates such as CP-algorithms but I cannot digest it because it includes so many libraries that I cannot remember to use in some competitions. So can someone give a easy to comprehend template for Polynomials.
Requirements:
FFT , NTT for mod like 998244353 and 1e9+7 .
Logarithm of polynomials .
Exponent of polynomials .
Hopefully someone can share the link.
Thank you.
Name |
---|