• <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
            哈哈哈哈哈哈
            7777精品久久久大香线蕉 | 精品久久久久久无码专区| 久久精品国产AV一区二区三区 | 看久久久久久a级毛片| 久久国产乱子伦免费精品| 伊人久久免费视频| 久久人人爽人人人人片av| 久久强奷乱码老熟女网站| 婷婷综合久久中文字幕| 国产精品亚洲综合久久| 国产成人综合久久综合| 狠狠色综合网站久久久久久久高清 | 久久91精品久久91综合| 亚洲欧洲中文日韩久久AV乱码| 97精品依人久久久大香线蕉97| 久久91精品国产91久久麻豆| 久久久久久久久66精品片| 亚洲狠狠综合久久| 99国产欧美久久久精品蜜芽| 色综合久久88色综合天天 | 久久被窝电影亚洲爽爽爽| 久久大香萑太香蕉av| 久久精品国产第一区二区| 国产精品久久国产精品99盘| 久久天天躁狠狠躁夜夜2020一 | 久久强奷乱码老熟女| 久久人人爽人人爽人人AV东京热| 欧美一级久久久久久久大| 国产精品美女久久久久av爽| 久久99精品久久久久久久不卡| 久久久亚洲精品蜜桃臀| 国产精品成人久久久久三级午夜电影| 2021久久国自产拍精品| 蜜臀av性久久久久蜜臀aⅴ | 伊人色综合久久| 亚洲国产精品久久久久| 伊人久久综在合线亚洲2019| 久久精品成人免费看| 国产精品亚洲综合专区片高清久久久 | 一本色道久久88综合日韩精品 | 欧美一区二区久久精品|