Hdu1178Heritage from father
来源:互联网 发布:c语言中log怎么表示 编辑:程序博客网 时间:2024/05/29 12:28
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)
Total Submission(s): 5118 Accepted Submission(s): 1811
Total Submission(s): 5118 Accepted Submission(s): 1811
Problem Description
Famous Harry Potter,who seemd to be a normal and poor boy,is actually a wizard.Everything changed when he had his birthday of ten years old.A huge man called 'Hagrid' found Harry and lead him to a new world full of magic power.
If you've read this story,you probably know that Harry's parents had left him a lot of gold coins.Hagrid lead Harry to Gringotts(the bank hold up by Goblins). And they stepped into the room which stored the fortune from his father.Harry was astonishing ,coz there were piles of gold coins.
The way of packing these coins by Goblins was really special.Only one coin was on the top,and three coins consisted an triangle were on the next lower layer.The third layer has six coins which were also consisted an triangle,and so on.On the ith layer there was an triangle have i coins each edge(totally i*(i+1)/2).The whole heap seemed just like a pyramid.Goblin still knew the total num of the layers,so it's up you to help Harry to figure out the sum of all the coins.
If you've read this story,you probably know that Harry's parents had left him a lot of gold coins.Hagrid lead Harry to Gringotts(the bank hold up by Goblins). And they stepped into the room which stored the fortune from his father.Harry was astonishing ,coz there were piles of gold coins.
The way of packing these coins by Goblins was really special.Only one coin was on the top,and three coins consisted an triangle were on the next lower layer.The third layer has six coins which were also consisted an triangle,and so on.On the ith layer there was an triangle have i coins each edge(totally i*(i+1)/2).The whole heap seemed just like a pyramid.Goblin still knew the total num of the layers,so it's up you to help Harry to figure out the sum of all the coins.
Input
The input will consist of some cases,each case takes a line with only one integer N(0<N<2^31).It ends with a single 0.
Output
对于每个输入的N,输出一行,采用科学记数法来计算金币的总数(保留三位有效数字)
Sample Input
130
Sample Output
1.00E01.00E1when N=1 ,There is 1 gold coins. when N=3 ,There is 1+3+6=10 gold coins.HintHint
Source
Gardon-DYGG Contest 1
Recommend
JGShining | We have carefully selected several similar problems for you: 1019 1049 1205 1030 1163
题目的意思就是算出金子的总数用科学计数法表示,这道题目考的是输出问题。
pow(a, b)
函数的意思是求幂运算。
代码:
#include<iostream>
#include<cstdio>
#include<math.h>
using namespace std;
int main()
{
double n,a,m,b;
while(scanf("%lf",&n)!=EOF&&n!=0)
{
b=log10(n*1.0/6)+log10((n+1)*1.0)+log10((n+2)*1.0);
a=b-(int)(b);
m=pow(double(10),a);
printf("%.2lfE%d\n",m,(int)(b));
}
return 0;
}
#include<math.h>
using namespace std;
int main()
{
double n,a,m,b;
while(scanf("%lf",&n)!=EOF&&n!=0)
{
b=log10(n*1.0/6)+log10((n+1)*1.0)+log10((n+2)*1.0);
a=b-(int)(b);
m=pow(double(10),a);
printf("%.2lfE%d\n",m,(int)(b));
}
return 0;
}
0 0
- Hdu1178Heritage from father
- Heritage from father
- Heritage from father
- Heritage from father
- Heritage from father
- HDU Heritage from father
- 1178 hdu Heritage from father
- hdu 1178 Heritage from father
- HDU 1178 Heritage from father
- HDU 1178 Heritage from father
- HDU 1178Heritage from father
- HDU 1178 Heritage from father
- hdu---1178Heritage from father
- hdu1178数学题 Heritage from father
- 杭电 - Heritage from father
- hdu(1178)Heritage from father
- Heritage from father HDU1178 居然TLE!!!
- hdu1178——Heritage from father
- 双向回拨技术介绍
- 第11周项目6(1000以内所有素数)
- 自定义缓存图片
- qt2010设置
- 通过LeakDiag查看内存泄漏
- Hdu1178Heritage from father
- iOS开发常用的开源类库
- 通过Openstack + novadocker创建有存储功能的docker
- centos 下安装ati显卡驱动方法
- mysql 创建视图
- CSS颜色代码大全视图参照表!
- 常见错误2
- HttpServletRequest调用getRemoteAddr获取IP返回0:0:0:0:0:0:0:1的问题
- 如何中断JAVA线程