Heritage from father HDU1178 居然TLE！！！



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.
  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  

   
   这个题思路很简单，纯粹的数学公式计算
  
  
  
  

   
   比较难的地方在于最后的输出格式处理。好吧，我承认这个题我一共提交了10遍，不是我蠢，实在是太坑。万万没想到N居然可以是个小数，（话说N不是层数么。。。怎么来的小数。。。）然后我就看着一遍又一遍的TLE,差点崩溃。。。。。
  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  

   
   //
  
  
  
  

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

   
   
int main()
  
  
  
  

   
   {
    long k,l;
    double n,dGolds;
  
  
  
  

   
       while(scanf("%lf",&n) != EOF && n!=0)
    {
  
  
  
  

   
           dGolds = (1+n)*n/4.0 +(1+n)*(2*n+1)*n/12.0;
  
  
  
  

   
   
        k = (int)log10(dGolds);
        l =k;
        while(l--)
        dGolds = dGolds * 0.1;
        printf("%.2lfE%ld\n",dGolds,k);
    }
    return 0;
}