hdoj5053the Sum of Cube

Problem Description

A range is given, the begin and the end are both integers. You should sum the cube of all the integers in the range.

 

Input

The first line of the input is T(1 <= T <= 1000), which stands for the number of test cases you need to solve.
Each case of input is a pair of integer A,B(0 < A <= B <= 10000),representing the range[A,B].

 

Output

For each test case, print a line “Case #t: ”(without quotes, t means the index of the test case) at the beginning. Then output the answer – sum the cube of all the integers in the range.

 

Sample Input

21 32 5

 

Sample Output

Case #1: 36Case #2: 224

 

代码如下：

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){    double sum,i;//考虑到大数，sum和i定义为double型.    int t,n,m,l=0;    scanf("%d",&t);    while(t--)    {        sum=0;                scanf("%d%d",&n,&m);        for(i=n;i<=m;i++)        {            sum+=i*i*i;        }        l++;        printf("Case #%d: %.lf\n",l,sum);    }}