CF622F.The Sum of the k-th Powers
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
There are well-known formulas: ,
,
. Also mathematicians found similar formulas for higher degrees.
Find the value of the sum modulo 109+7 (so you should find the remainder after dividing the answer by the value 109+7 ).
输入格式
The only line contains two integers n,k ( 1<=n<=109,0<=k<=106 ).
输出格式
Print the only integer a — the remainder after dividing the value of the sum by the value 109+7 .
输入输出样例
输入#1
4 1
输出#1
10
输入#2
4 2
输出#2
30
输入#3
4 3
输出#3
100
输入#4
4 0
输出#4
4