NY879大水比
来源:互联网 发布:lc32es62数据 编辑:程序博客网 时间:2024/04/27 23:57
- 题目879
- 题目信息
- 运行结果
- 本题排行
- 讨论区
Consecutive sum II
时间限制:3000 ms | 内存限制:65535 KB
难度:2
- 描述
Consecutive sum come again.
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.- 输入
- The first integer is T, and T lines will follow.
Each line will contain an integer N (0 <= N <= 20000). - 输出
- For each case, output the right numbers in the Nth line.
All answer in the range of signed 64-bits integer. - 样例输入
3012
- 样例输出
0 11 88 27
- 上传者
ACM_吕德铭
import java.util.*;public class Main {public static void main(String[] args) {Scanner in = new Scanner(System.in); int n=in.nextInt(); for(int i=0;i<n;i++){ long m=in.nextLong(); long mm=m+1; long a1=m*m*m; long a2=mm*mm*mm; System.out.println(a1+" "+a2); }}}
0 0
- NY879大水比
- 大水比的崛起
- 大水题!!!
- 大水题
- 大水的遗言
- poj 1656 大水题
- POJ 2328 大水题
- hdu 4247 大水题
- hdu4252 大水题
- hdu 4206 大水题
- hdu1372 广搜大水
- 大水题Q2002
- 大水题Q2003
- 大水题Q2006
- 暴力枚举大水题
- nefu 648 大水题
- poj2707~大水题
- 超级大水贴
- 编程之美-分层遍历二叉树
- JSOUP抓取网页内容
- chan editor 轻量级的带语法高亮的代码编辑器
- WPF中Height和ActualHeight的区别
- 招聘季总结
- NY879大水比
- Codeforces Round #290 D. Fox And Jumping
- opencv 3.0 灰度图 转 彩图 applyColorMap
- 有关多线程的一些技术问题
- 求矩形的重叠率
- 自定义类加载器
- CCOrbitCamera动作,位放置左上角有视角差
- Android中的Selector使用详解
- github安装过程