• <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 閱讀(484) 評論(0)  編輯 收藏 引用 所屬分類: Questions
            哈哈哈哈哈哈
            99久久精品国产综合一区| 色偷偷偷久久伊人大杳蕉| 久久久久亚洲av综合波多野结衣| 国产香蕉久久精品综合网| 香蕉久久av一区二区三区| 久久婷婷色综合一区二区| 综合久久给合久久狠狠狠97色 | 狼狼综合久久久久综合网| 久久综合久久久| 久久精品一本到99热免费| 久久最近最新中文字幕大全 | 狠色狠色狠狠色综合久久| 午夜精品久久久久9999高清| 久久99国产综合精品| 青青热久久国产久精品 | 久久96国产精品久久久| 久久精品无码免费不卡| 久久综合狠狠综合久久| 色综合合久久天天给综看| 99久久免费国产精品热| 2020国产成人久久精品| 久久本道久久综合伊人| 久久超碰97人人做人人爱| 香蕉久久久久久狠狠色| 777久久精品一区二区三区无码| 国产aⅴ激情无码久久| 久久一区二区免费播放| 久久噜噜电影你懂的| 久久久久久午夜成人影院| 欧美亚洲国产精品久久| 久久久久亚洲?V成人无码| 久久青青草原精品影院| 久久久久亚洲精品天堂| 久久久久亚洲AV片无码下载蜜桃| 国产精品美女久久久免费| 模特私拍国产精品久久| 久久99精品国产麻豆婷婷| 久久久久久久综合日本亚洲| 77777亚洲午夜久久多喷| 无码人妻久久一区二区三区| 久久精品亚洲AV久久久无码|