I want to ask about this problem: 622F - The Sum of the k-th Powers. I solved it using lagrange interpolation 263080914 but can anyone help me implement the solution with Faulhaber's formula? Thanks very much.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | ecnerwala | 3654 |
3 | jiangly | 3627 |
4 | jqdai0815 | 3620 |
5 | orzdevinwang | 3612 |
6 | Benq | 3586 |
7 | Radewoosh | 3582 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3474 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
4 | atcoder_official | 153 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 145 |
10 | cry | 144 |
I want to ask about this problem: 622F - The Sum of the k-th Powers. I solved it using lagrange interpolation 263080914 but can anyone help me implement the solution with Faulhaber's formula? Thanks very much.
Название |
---|
It's not easy to calculate the `Bernoulli number'. Also, the modulo is not NTT friendly.
Consider these blogs: Prefix Sum Polynomial, and Counting sums of powers for "How to generate Bernoulli number".