• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            voip
            風的方向
            厚德致遠,博學敦行!
            posts - 52,comments - 21,trackbacks - 0
                     這個題目,我們讓老師鄙視了。。。

            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

            For each test case, output a line contains the number of all the coins, the format like the sample out(2 decimal digits).

            Sample Input

            1
            3
            0
            

             

            Sample Output

            1.00E0
            1.00E1
            

             

            Hint

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


                     題目很簡單,求Sn=i*(i+1)/2的前n項和,n由題目給出。
                     平方和公式:1^2+2^2+3^2+...+n^2=n(n+1)(2*n+1)/6       等差求和:1+2+3+...+n=n*(n+1)/2

            代碼如下:
            #include<stdio.h>
            #include
            <math.h>
            int  main()
            {

                
            double test,sum;
                
            int i;

                scanf(
            "%lf",&test);

                
            while(test!=0)
                
            {
                    sum
            =((test*(test+1)*(2*test+1))/6+(test*(test+1))/2)/2;
                    i
            =0;
                    
            while(sum>=10)
                    
            {
                        i
            ++;
                        sum
            =sum/10;
                    }

                    printf(
            "%.2fE%d\n",sum,i);
                      scanf(
            "%lf",&test);
                }

                
            return 0;
            }

            posted on 2010-09-06 10:11 jince 閱讀(500) 評論(0)  編輯 收藏 引用 所屬分類: Questions
            哈哈哈哈哈哈
            日日狠狠久久偷偷色综合0| 久久国产乱子精品免费女| 青青青伊人色综合久久| 久久久久波多野结衣高潮| 国产精品视频久久久| 亚洲日本久久久午夜精品| 久久久一本精品99久久精品66| 中文成人久久久久影院免费观看| 欧美一区二区精品久久| 91久久婷婷国产综合精品青草| 奇米综合四色77777久久| 亚洲精品无码久久久影院相关影片| 久久精品国产亚洲AV香蕉| 久久精品国产男包| 亚洲愉拍99热成人精品热久久| 一本色道久久HEZYO无码| 久久久久久亚洲精品成人| 久久A级毛片免费观看| 国产精品久久久久久搜索| 久久婷婷久久一区二区三区| 国产亚洲婷婷香蕉久久精品| 97精品伊人久久久大香线蕉 | 亚洲人成电影网站久久| 久久久久99这里有精品10| 99久久国产综合精品女同图片| 久久婷婷五月综合97色一本一本 | 囯产精品久久久久久久久蜜桃| 国产色综合久久无码有码| 国产精品久久影院| 国产精品激情综合久久| 色婷婷久久久SWAG精品| 久久亚洲AV成人无码国产 | 一本一本久久aa综合精品| 久久99国产精品尤物| 精品久久久久久国产免费了| 国产美女亚洲精品久久久综合| 久久国产精品99久久久久久老狼 | 久久只有这精品99| 精品久久久噜噜噜久久久| 久久夜色撩人精品国产| 久久99精品久久久久久动态图|