• <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
            哈哈哈哈哈哈
            精品久久久久久| 成人亚洲欧美久久久久| 超级碰碰碰碰97久久久久| 性高湖久久久久久久久AAAAA| 亚洲女久久久噜噜噜熟女| 精品久久久久久无码专区不卡| 国内精品久久久久影院网站| 精品久久久中文字幕人妻| 久久久久女人精品毛片| 狠狠干狠狠久久| 97久久国产综合精品女不卡| 99久久精品免费看国产免费| 久久久久久久综合狠狠综合| 久久精品国产亚洲综合色| 超级碰碰碰碰97久久久久| 99久久精品国产毛片| 国产精品久久久久AV福利动漫| 久久青青草原亚洲av无码| 久久久久久亚洲精品成人| 亚洲精品成人久久久| 久久久久久久综合日本| 久久精品国产亚洲av影院 | 亚洲精品成人网久久久久久| 久久99精品国产麻豆| 香蕉久久夜色精品升级完成| 久久人人爽人人澡人人高潮AV| 国产精品久久影院| 99久久超碰中文字幕伊人| 日本欧美国产精品第一页久久| 久久久久国产| 久久99国产精品久久久 | 久久精品无码午夜福利理论片 | 国产激情久久久久久熟女老人| 久久国产精品免费| 88久久精品无码一区二区毛片| 国产一区二区精品久久岳| 99久久精品午夜一区二区| 99久久人妻无码精品系列| 国内精品久久久久影院优| 国产精品一久久香蕉国产线看观看 | 国产成人精品综合久久久久|