hdoj 1977 Consecutive sum II

Consecutive sum II

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2443    Accepted Submission(s): 1177

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
  
  

 

此题测试数据比较水，n取2100000时 即使int64 也不够用，结果就ac了；

 

#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
    __int64 t,n,i,j;
    scanf("%I64d",&t);
    while(t--)
    {
        scanf("%I64d",&n);
        printf("%I64d %I64d\n",n*n*n,(n+1)*(n+1)*(n+1));
    }
    return 0;
}