the Sum of Cube

the Sum of Cube

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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 
       
       

 

---

求1到n所有数的立方和

可以直接暴力循环算

也可以直接用公式((n+1)*n/2*((n+1)*2/2)

 1³+2³+3³+…+n³=（n*(n+1)/2）²

#include<cstdio>
__int64 a[10010]={0};
void san(){
	for( __int64 i=0;i<10010;i++)
		a[i]=i*i*i;
}
int main(){
	san();
	int t;scanf("%d",&t);
	int m,n;
	int k=0;
	while(t--){
		__int64 sum=0;
		scanf("%d%d",&m,&n);
		for(int i=m;i<=n;i++){
			sum+=a[i];
		}//或者直接让sum=(n+1)*n/2*((n+1)*n/2)
		printf("Case #%d: %I64d\n",++k,sum);
	}
	return 0;
}