• <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无码久久精品成人| 久久国产精品一区二区| 性高湖久久久久久久久AAAAA| 午夜精品久久久久久中宇| 久久免费线看线看| 国内精品伊人久久久影院| 久久er99热精品一区二区| 久久最新免费视频| 国产美女久久精品香蕉69| 久久免费香蕉视频| 狠狠色婷婷综合天天久久丁香| 一97日本道伊人久久综合影院| 国产精品久久波多野结衣| 亚洲国产成人久久综合一区77| 久久精品水蜜桃av综合天堂| 亚洲人成网站999久久久综合 | 久久精品成人国产午夜| 一级做a爰片久久毛片看看 | 欧美久久久久久精选9999| 久久久久久九九99精品| 久久91精品国产91久| 久久久久久国产精品美女| 国产精品岛国久久久久| 久久久久亚洲av无码专区喷水| 色婷婷狠狠久久综合五月| 精品久久久无码中文字幕| 99久久精品国产免看国产一区| 精品国产乱码久久久久久人妻| 午夜精品久久久久久影视777| 国产精品青草久久久久福利99| 2021久久国自产拍精品| 国内精品久久久久久久97牛牛| 99久久精品免费看国产一区二区三区| 色综合久久中文字幕综合网| 狠狠精品久久久无码中文字幕| 99久久免费国产精品| 久久se这里只有精品|