Problem descriptiona range is given, the begin and the end are both integers. You shoshould sum the cube of all the integers in the range.
Inputthe 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].
Outputfor 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
21 32 5
Sample output
Case #1: 36Case #2: 224
Source2014 ACM/ICPC Asia Regional Shanghai Online
Question: Not difficult
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>typedef __int64 ll;using namespace std;int main() { int t, a, b, cas =1 ; scanf("%d", &t); while (t--) { scanf("%d%d", &a, &b); ll sum = 0; for (int i = a; i <= b; i++) sum += (ll)i * i * i; printf("Case #%d: ", cas++); printf("%I64d\n", sum); } return 0;}
HDU-5053 the sum of cube
