the 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

2 1 3 2 5

 

Sample Output

Case #1: 36 Case #2: 224

#include<cstdio>
long long lifang[10001];
void dabiao()
	{
		for(long long  i=1;i<10001;i++)
		{ 
		  lifang[i]=i*i*i;
	    }
	}
int main()
{
	dabiao();
    int t;
    int cut=0;
    scanf("%d",&t);
    while(t--)
    {
    	long long n,m;
    	scanf("%lld%lld",&n,&m);
    	long long sum=0;
    	for(long long i=n;i<=m;i++)
    	{
    	sum+=lifang[i];	
		}
		printf("Case #%d: %lld
",++cut,sum);
	}
	return 0;
}