HDOJ-5053(the Sum of Cube)

HDOJ-5053(the Sum of Cube)

the Sum of Cube

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2084    Accepted Submission(s): 849

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
  
  

 My  solution:

/*2015.12.20*/

<span style="font-size:18px;">#include<stdio.h> 
#include<math.h>
int main()
{
    int t,a,b;
    double n,sum,i;
    scanf("%d",&t);
    int m=0;
    while(t--)
    {
        sum=0;
        scanf("%d%d",&a,&b);
        for(i=a;i<=b;i++)
        {
            n=i*i*i;//</span><span style="font-size:14px;">考虑到大数因素,i虽然没有超出int范围,但是在计算i*i*i时,就超出int范围了,因此要定义成double型</span><span style="font-size:18px;">
            sum=sum+n;
        }
        m++;
        printf("Case #%d: %.lf\n",m,sum);
    }
    return 0;
}</span>