HDU 1977 Consecutive sum II
来源:互联网 发布:辐射4 捏脸数据 编辑:程序博客网 时间:2024/06/05 03:35
http://acm.hdu.edu.cn/showproblem.php?pid=1977
Consecutive sum II
Time Limit: 3000/1000 MS(Java/Others)
Total Submission(s):894
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. Thenth line will have 2*n+1 consecutive numbers on the left, the firstnumber on the right equal with the second number in last line, andthe sum of left numbers equal with two number’s sum on theright.
Your task is that tell me the right numbers in the nthline.
1
2+3+4
5+6+7+8+9
…
You can see the consecutive sum can be representing like that. Thenth line will have 2*n+1 consecutive numbers on the left, the firstnumber on the right equal with the second number in last line, andthe sum of left numbers equal with two number’s sum on theright.
Your task is that tell me the right numbers in the nthline.
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 12
Sample Output
0 1 1 8 827
Author
Wiskey
Source
2008杭电集训队选拔赛
Recommend
wangye
分析:找规律。
代码如下:
(1)按我找的规律写的:
#include<stdio.h>
#include<string.h>
long long biao[2100010];
void fun()
{
memset(biao,0,sizeof(biao));
__int64 i;
biao[0]=1;
for(i=1;i<2100010;i++)
biao[i]=2*i*i*i+3*i*i+3*i+1-biao[i-1];
}
int main()
{
int T,n;
fun();
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
if(n==0) printf("0 1\n");
else printf("%I64d%I64d\n",biao[n-1],biao[n]);
}
return 0;
}
#include<string.h>
long long biao[2100010];
void fun()
{
}
int main()
{
}
(2)网上看到的 转载自:yzy杨子衍
#include <stdio.h>
int main ()
{
__int64 n,t,m;
scanf("%I64d",&t);
while (t--)
{
scanf("%I64d",&n);
m=n+1;
printf("%I64d%I64d\n",n*n*n,m*m*m);
}
return 0;
}
{
__int64 n,t,m;
scanf("%I64d",&t);
while (t--)
{
}
return 0;
}
阅读全文
0 0
- HDU 1977 Consecutive sum II
- hdu 1001 Sum Problem
- hdu 1003 Max Sum
- Hdu 1003 max sum _DP
- POJ 2739 Sum of Consecutive Prim…
- HDU 1242 Rescue
-  
- HDU 3473 Minimum Sum(划分树)
- hdu 1003 Max Sum//DP
- hdu 1024 Max Sum Plus Plus//DP
-
- sql sum 空或0
- Nios II Step By Step 3--Nios II …
- ZZULI_SummerPractice(3) HDU 1…
- HDU 1579 Function Run Fun
- HDU 1405 The Last Practice
- HDU 2050 折线分割平面
- hdu 1000 A + B Problem
- HDU 2060 Snooker
- Cloudera Apache Hadoop 管理员培训—助力进阶大数据知识与技能
- CentOS7使用firewalld打开关闭防火墙与端口
- HDU 1985 Conversions
- Tomcat 可以localhost访问,但不能127.0.0.1访问(转)
- HDU 1977 Consecutive sum II
- HDU 1976 Software Version
- 移动端布局页面实现
- angularjs表头排序
- HDU 1877 又一版 A+B
- HDU 1862 EXCEL排序
- HDU 1859 最小长方形
- HDU 1799 循环多少次?
- web项目部署到Tomcat上使用