求i^k之和——HDU - 6027

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

Sample Input

3
2 5
4 2
4 1

Sample Output

33
30
10

题解：

快速幂求a^n的值，再在主函数中调用。

由于数值比较大，用  long long  型数

代码：

#include<stdio.h>
long long pow(int a,int n)
{//返回a^n
    long long result=1,flag=a;
	while(n)
	{
		if(n&1)
		result=result*flag%1000000007;
		flag=flag*flag%1000000007;
		n/=2;
	 } 
	 return result%1000000007;
}
int main()
{
	int t,n,k;
	scanf("%d",&t);
	while(t--)
	{
		int i;
		long long sum=0;
		scanf("%d %d",&n,&k);
		for(i=1;i<=n;i++)
		{
			sum+=pow(i,k)%1000000007;
		 } 
		 printf("%lld\n",sum%1000000007);
	}
	return 0;
}