Problem Description
Consecutive sum come again. Are you ready? Go ~~
1 = 0 + 1
2+3+4 = 1 + 8
5+6+7+8+9 = 8 + 27
…
You can see the consecutive sum can be representing like that. The nth line will have 2*n+1 consecutive numbers on the left, the first number on the right equal with the second number in last line, and the sum of left numbers equal with two number’s sum on the right.
Your task is that tell me the right numbers in the nth line.

Input
The first integer is T, and T lines will follow.
Each line will contain an integer N (0 <= N <= 2100000).

Output
For each case, output the right numbers in the Nth line.
All answer in the range of signed 64-bits integer.

Sample Input
3
0
1
2

Sample Output
0 1
1 8
8 27

看到有很多人的這個題目是找規律做的，我開始沒注意規律了，
就打表做了。。。。
現在給出2種能AC的方法：

第一種：打表：

import java.util.Scanner;public class Main{static long[] db1 = new long[2100005];public static void main(String[] args) {dabiao();//System.out.println("aa");Scanner sc = new Scanner(System.in);int t = sc.nextInt();while(t-->0){int n = sc.nextInt();System.out.println(db1[n]+" "+db1[n+1]);}}private static void dabiao() {db1[0] = 0;db1[1] = 1;db1[2] = 8;db1[3] = 27;long k=9;long num =7;Scanner sc = new Scanner(System.in);for(int i=4;i<=2100001;i++){db1[i] =(k+num/2+1)*num-db1[i-1]; // System.out.println(k); // System.out.println(num/2+1); // // System.out.println(i); // System.out.println(db1[i]); // System.out.println((k+num/2+1)*num); // int m = sc.nextInt();k=k+num;num+=2;}} }

第二種：找規律：

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int t =sc.nextInt();while(t-->0){long n =sc.nextLong();System.out.println(n*n*n+" "+(n+1)*(n+1)*(n+1));}} }

總結

以上是生活随笔為你收集整理的HDOJ(HDU) 1977 Consecutive sum II(推导、、)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。