the Sum of Cube
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1594 Accepted Submission(s): 621
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].
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
题意:求范围内的各数立方之和。(要注意数字的大小,用__int64)
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
int t,j=1;
__int64 m,n,i,sum;
cin>>t;
while (t--)
{
scanf("%I64d%I64d",&m,&n);
sum=0;
for(i=m;i<=n;i++)
{
sum+=i*i*i;
}
printf("Case #%d: %I64d\n",j++,sum);
}
return 0;
}