sum of power

sum of power
Time Limit: 1000MS Memory Limit: 65536KB
Submit Statistic
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.
Example Input

10 0
Example Output

10
Hint

Author

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

注意数据范围~每一步都要取模！

#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main()
{
    int n, m;
    long long int sum, ans;
    while(cin>>n>>m)
    {
        ans = 0;
        for(int i=1;i<=n;i++)
        {
            sum = 1;
            for(int j=0;j<m;j++)
            {
                sum = (sum * i) % mod;
            }
            ans = (sum + ans) % mod;
        }
        cout<<ans<<endl;
    }
    return 0;
}