the Sum of Cube
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1218 Accepted Submission(s): 484
Each case of input is a pair of integer A,B(0 < A <= B <= 10000),representing the range[A,B].
2 1 3 2 5
Case #1: 36 Case #2: 224
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 1000010
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
ll sum;
ll n,m;n,m也用long long
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t;
while(~scanf("%d",&t))
{
for(int j=1;j<=t;j++)
{
scanf("%I64d%I64d",&n,&m);
sum=0;
for(ll i=n;i<=m;i++)
sum+=(ll)(i*i*i);
printf("Case #%d: %I64d\n",j,sum);
}
}
return 0;
}