zoukankan      html  css  js  c++  java
  • 杭电 5053 the Sum of Cube(求区间内的立方和)打表法

    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
     
     1 #include<cstdio>
     2 __int64 a[1000000]={0,1};
     3 int main()
     4 {
     5     for(__int64 i=1;i<=1000000;i++)
     6     {
     7         a[i]=a[i-1]+i*i*i;
     8     }
     9     __int64 t,k=0;;
    10     scanf("%I64d",&t);
    11     while(t--)
    12     {
    13         __int64 m,n;
    14         scanf("%I64d%I64d",&m,&n);
    15         printf("Case #%I64d: %I64d
    ",++k,a[n]-a[m-1]);
    16     }
    17 }
     
     
     
     
     
     
     
    ——将来的你会感谢现在努力的自己。
  • 相关阅读:
    点分治
    主席树
    可持久化并查集
    可持久化线段树
    网络流
    AC自动机
    线性基
    快速幂
    素数筛
    扩展欧几里得算法
  • 原文地址:https://www.cnblogs.com/yexiaozi/p/5689268.html
Copyright © 2011-2022 走看看