HDU - 6027-Easy Summation

Easy Summation

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)

Total Submission(s): 1871    Accepted Submission(s): 757

Problem Description

You are encountered with a traditional problem concerning the sums of powers.
Given two integers  n and  k. Let  f(i)=ik, please evaluate the sum  f(1)+f(2)+...+f(n). The problem is simple as it looks, apart from the value of  n in this question is quite large.
Can you figure the answer out? Since the answer may be too large, please output the answer modulo  109+7.

 

Input

The first line of the input contains an integer  T(1≤T≤20), denoting the number of test cases.
Each of the following  T lines contains two integers  n(1≤n≤10000) and  k(0≤k≤5).

 

Output

For each test case, print a single line containing an integer modulo  109+7.

 

Sample Input

3 2 5 4 2 4 1

 

Sample Output

33 30 10

emmmmm这题意思是f(i)=i^k;求i从1->n时f(i)的和

但是。。。貌似数据太大要爆long long。。。于是只能每次得到答案一旦超出1e9+7就取模，最后暴力出奇迹。。。

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#define MOD 1000000007
using namespace std;
int main()
{ int t,n,k;
  scanf("%d",&t);
  long long a[10050];
  long long ans;
  while (t--){
  ans=0;
  memset(a,0,sizeof(a));
  scanf("%d%d",&n,&k);
  if (k==0)printf("%d\n",n);
  else {
  for (int i=1;i<=n;i++){
    a[i]=1;

    for (int j=1;j<=k;j++)
    {
        a[i]=a[i]*i;
        if (a[i]>=MOD)a[i]=a[i]%MOD;
    }
     ans=ans+a[i];
    if (ans>=MOD)ans=ans % MOD;
  }
    printf("%lld\n",ans);
   }
  }
   return 0;
}