题目
求: ∑ i = 1 n ∑ j = 1 m i j % ( 1 0 9 + 7 ) , 1 ≤ n , m ≤ 100000 \sum_{i=1}^n\sum_{j=1}^mi^j\;\% \;(10^9+7),1\leq n,m \leq 100000 ∑i=1n∑j=1mij%(109+7),1≤n,m≤100000
分析
- 等比数列求和
∑ i = 1 n ∑ j = 1 m i j = m + ∑ i = 2 n i m + 1 − i i − 1 \sum_{i=1}^n\sum_{j=1}^mi^j=m+\sum_{i=2}^{n}\frac{i^{m+1}-i}{i-1} i=1∑nj=1∑mij=m+i=2∑ni−1im+1−i - 快速幂计算 i m + 1 i^{m+1} im+1
- 线性求逆元计算 ( i − 1 ) − 1 (i-1)^{-1} (i−1)−1
代码
// hdu 求和
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MAXN 100010
int inv[MAXN];
int ksm(int base, int pow){
int res = 1;
while(pow){
if(pow & 1) res = 1LL * res * base % MOD;
base = 1LL * base * base % MOD;
pow >>= 1;
}
return res;
}
int main(){
int n, m, ans;
inv[1] = 1;
for(int i=2; i < MAXN; ++i) inv[i] = 1LL*(MOD-MOD/i)*inv[MOD%i]%MOD;
while(scanf("%d%d", &n, &m) == 2){
ans = m;
for(int i = 2; i <= n; ++i){
ans = (ans + 1LL*(ksm(i, m+1)-i)*inv[i-1])%MOD;
}
printf("%d\n", ans);
}
return 0;
}