3899 sum of power

sum of power

Time Limit: 1000 ms Memory Limit: 65536 KiB

Submit Statistic Discuss

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

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std ; 


int main()
{
    long long n , m ; 
    cin>>n>>m;
        long long result = 0 ; 
        for(int i=1 ; i<= n ; i++)
{
            long long num = 1 ; 
            for(int j=1 ; j<=m ; j++)
{
                num = num * i %1000000007 ; 
            }
            result = (result + num ) % 1000000007 ; 
        }
        cout<<result<<endl;  
    return 0; 
}