Hello, I have a problem need to solve:
S(n) = 1^k + 2^k +..+n^k
input: n<=10^9, k<=40
output: S(n)%(10^9+7).
One more issue:
how to calculate ((n^k)/x)%p which very big n and k.
Thank for helping me.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 20.04.2026 20:17:39 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
See here for finding S(n). ((n^k)/x)%p = ((n^k)%(x*p))/x. Use binary exponentiation to evaluate (n^k)%(x*p).
Thanks you
Easy to prove that the answer is a polynomial with deg ≤ k + 1. So you can find its coefficients using Gaussian elimination or any other way to interpolate it.
Easy to prove that the answer is a polynomial with deg ≤ k + 1.
how?
For instance, using recurrent equation for sum of k-th powers through previous powers sums (see the link above).
Check Div1-500 here.