Heritage from father

Heritage from father

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)

Total Submission(s): 5178 Accepted Submission(s): 1837

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、这个大家都会：1+2+3+4+…n=n(n+1)/2
2、这个有些同学忘记了：
	1*1+2*2+3*3+…+n*n=n(n+1)(2n+1)/6
3、合并后得到n(n+1)(n+2)/3
  
  
  
  

   
   

  
  
  
  

   
   即求和公式为：(1.0*n*n*n+3.0*n*n+2.0*n)/6.0=((n(n+1)/2)+(n(n+1)(2n+1)/6))/2
  
  
  
  

   
   

  
  
  
  

   
   源代码：
  
  
  
  

   
   #include <stdio.h>
#include <math.h>
#include <stdlib.h>

int main()
{
  int n,b;
  float a;
  while(scanf("%d",&n) && n)
  {
    a=(1.0*n*n*n+3.0*n*n+2.0*n)/6.0;
    b=(int)log10(a);  //求得b为指数
    printf("%.2lf",a/pow(10,b));//小数部分
    printf("E%d\n",b); //指数部分                  
  }
  system("pause");
  return 0;    
}