
ZOJ Problem Set  2865
This task is very simple. You are to calculate Σi^{k} (1 <= i <= n). Input: There are multiple cases in the input. Each case begins with two integer n and k (0 <= n <= 10^{50}, 1 <= k <= 100). Output: For each test, print the answer in a single line. Sample Input: 2 3 3 2 Sample Output: 9 14 Author: SHANG, Zechao Source: ZOJ Monthly, June 2007 