首页 > 代码库 > HDU 1977 Consecutive sum II(数学)
HDU 1977 Consecutive sum II(数学)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1977
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.
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).
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.
All answer in the range of signed 64-bits integer.
Sample Input
3 0 1 2
Sample Output
0 1 1 8 8 27
Author
Wiskey
Source
2008杭电集训队选拔赛
PS:
找到规律就OK啦2333333333!
代码如下:
#include <cstdio> int main() { int t; __int64 n; scanf("%d",&t); while(t--) { scanf("%I64d",&n); printf("%I64d %I64d\n",n*n*n,(n+1)*(n+1)*(n+1)); } return 0; }
HDU 1977 Consecutive sum II(数学)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。