题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5053
题意:求[A,B]区间内立方和,(0 < A <= B <= 10000),。
题解:直接立方和公式。。
代码:
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
using namespace std;
#define min2(x, y) min(x, y)
#define max2(x, y) max(x, y)
#define min3(x, y, z) min(x, min(y, z))
#define max3(x, y, z) max3(x, max(y, z))
#define clr(x, y) memset(x, y, sizeof(x))
#define fr(i,n) for(int i = 0; i < n; i++)
#define fr1(i,n) for(int i = 1; i < n; i++)
#define upfr(i,j,n) for(int i = j; i <= n; i++)
#define dowfr(i,j,n) for(int i = n; i >= j; i--)
#define scf(n) scanf("%d", &n)
#define scf2(n,m) scanf("%d %d",&n,&m)
#define scf3(n,m,p) scanf("%d %d %d",&n,&m,&p)
#define ptf(n) printf("%d",n)
#define ptf64(n) printf("%I64d",n)
#define ptfs(s) printf("%s",s)
#define ptln() printf("\n")
#define ptk() printf(" ")
#define ptc(c) printf("%c",c)
#define srt(a,n) sort(a,n)
#define LL long long
#define pi acos(-1.0)
#define inf 1 << 31-1
#define eps 0.00001
#define maxn 10005
#define mod 10000007
int main()
{
int t;
scf(t);
int ca = 1;
while(t--)
{
__int64 a,b;
scanf("%I64d %I64d", &a, &b);
a = a - 1;
__int64 ans = (b*b*b*b + 2*b*b*b + b*b - a*a*a*a - 2*a*a*a - a*a )/ 4;
printf("Case #%d: %I64d\n", ca++, ans);
}
return 0;
}