Heritage from father

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131070/65535K (Java/Other)

Total Submission(s) : 73   Accepted Submission(s) : 26

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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.

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

1
3
0

Sample Output

1.00E0
1.00E1

Hint

Hint
when N=1 ,There is 1 gold coins.
when N=3 ,There is 1+3+6=10 gold coins.

 

 

 

 

 

1^2+2^2+3^2...+N^2 = N*(N+1)*(2N+1)/6             .......等式1
1+2+3...+N=N*(N+1)/2             .......等式2
(等式1+等式2)/2 = N*(N+1)*(N+2)/6

关键是输出格式

#include <iomanip>
#include <cmath>
using namespace std;
int main()
{
    int N,L;
    double Ans,tmp;
    while(cin>>N)
    {
        if(N==0) break;
        tmp = N;
        Ans = log10(tmp/6)+log10(tmp+1)+log10(tmp+2);
        L = int(Ans);
        cout<<fixed<<setprecision(2)<<pow(10.0,Ans-L)<<'E'<<L<<endl;
    }
    return 0;
} 

#include<iostream>   
#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
",m,(int)(b));  
    }  
    return 0;  
}  

#include <iomanip>
#include <cmath>
using namespace std;
int main()
{
    int N,L;
    double Ans,tmp;
    while(cin>>N)
    {
        if(N==0) break;
        tmp = N;
        Ans = log10(tmp/6)+log10(tmp+1)+log10(tmp+2);
        L = int(Ans);
        cout<<fixed<<setprecision(2)<<pow(10.0,Ans-L)<<'E'<<L<<endl;
    }
    return 0;
} 
#include <stdio.h>
int main()
{
    int n;
    double sum;
    char str[20];  /* 存储   1.23E+123   九个字符   */
    int integer,decimal,exponent;
    while(scanf("%d",&n)&&(n!=0))
    {
        sum=1.0*n*(n+1)*(n+2)/6; /* 不能1.0 试试 2147483647 */
 /*
        方法1：循环求指数
        	for(e=0;sum>=10;e++)  sum=sum/10;
               printf("%.2lfE%d
",sum,e);
 */
/*
		方法2
		double Ans,tmp;
        tmp = n;
        Ans = log10(tmp/6)+log10(tmp+1)+log10(tmp+2);
        L = int(Ans);
        cout<<fixed<<setprecision(2)<<pow(10.0,Ans-L)<<'E'<<L<<endl;		
		
*/

        sprintf(str,"%.2E",sum);
        sscanf(str,"%d.%2dE+%3d",&integer,&decimal,&exponent);
        printf("%d.%02dE%d
",integer,decimal,exponent);
 /*
        方法3：巧用输出格式
        		sscanf(str+6,"%3d",&exponent);
        		printf("%.5s%d
",str,exponent);
 */
    }
    return 0;
}