sum of power

sum of power

Time Limit: 1000 ms Memory Limit: 65536 KiB

Problem Description

Calculate  mod (1000000000+7) for given n，m.

Input

Input contains two integers n,m(1≤n≤1000,0≤m≤10).

Output

Output the answer in a single line.

Sample Input

10 0

Sample Output

10

Hint

Source

“浪潮杯”山东省第八届ACM大学生程序设计竞赛（感谢青岛科技大学）

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<math.h>
using namespace std;
#define maxn 1000000007
int main(){
   int n,m;
   int i,j;
   long long int sum=0;
   scanf("%d%d",&n,&m);
   sum=0;
   if(m==0){
    cout<<n%maxn<<endl;
   }else{
   for(i=1;i<=n;i++){
     long long int s=1;
    for(j=1;j<=m;j++){
        s=s*i;
        s=s%maxn; //边算边取余，不然和pow没有区别 要提高运算效率
    }
    sum=sum+s;
   }
    sum=sum%maxn;
   cout<<sum<<endl;
   }
   return 0;
}