• <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 閱讀(488) 評論(0)  編輯 收藏 引用 所屬分類: Questions
            哈哈哈哈哈哈
            久久精品中文字幕一区| 人妻精品久久久久中文字幕一冢本| 久久精品国产99久久久香蕉| 思思久久99热只有频精品66| 国内精品久久久久伊人av| 精品久久久久久久久久中文字幕 | 久久久久久国产精品免费免费| 婷婷国产天堂久久综合五月| 精品久久香蕉国产线看观看亚洲 | 国产精品福利一区二区久久| 久久免费视频6| 99久久这里只有精品| 欧美精品国产综合久久| 九九热久久免费视频| 久久久久久亚洲Av无码精品专口| 亚洲日本va午夜中文字幕久久| 国产精品久久久久jk制服| 国产亚洲美女精品久久久2020| 91久久精品国产免费直播| 久久99国产乱子伦精品免费| 狠狠色丁香婷婷久久综合五月| 狠狠人妻久久久久久综合| 国产精品视频久久久| 午夜人妻久久久久久久久| 久久受www免费人成_看片中文| 国产综合成人久久大片91| 久久福利青草精品资源站免费| 久久人妻少妇嫩草AV无码专区| 精品久久久无码21p发布| 久久无码人妻精品一区二区三区| 99热精品久久只有精品| 欧美亚洲国产精品久久蜜芽| 免费国产99久久久香蕉| 精品国产乱码久久久久久郑州公司| 久久国产免费直播| 一本色道久久99一综合| 97精品依人久久久大香线蕉97| 99久久国产宗和精品1上映 | 久久99精品久久久久久水蜜桃| 国产精品无码久久四虎| 久久久久无码国产精品不卡|