标签：acm hdu
题意 求给定区间[a,b] 所有整数的立方和 0<a,b<=10000
注意10000^3会爆int
#include<cstdio>
using namespace std;
typedef long long ll;
int main()
{
int cas;
ll a, b, ans;
scanf("%d", &cas);
for(int k = 1; k <= cas; ++k)
{
ans = 0;
scanf("%I64d%I64d", &a, &b);
for(ll i = a; i <= b; ++i)
ans += i * i * i;
printf("Case #%d: %I64d\n", k, ans);
}
return 0;
}
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
Sample Output
Source
HDU 5053 the Sum of Cube
标签：acm hdu
原文地址：http://blog.csdn.net/acvay/article/details/39638559
