• <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
            哈哈哈哈哈哈
            欧美亚洲色综久久精品国产| 91精品国产91久久久久福利| 久久99精品久久久久婷婷| 久久久无码精品亚洲日韩蜜臀浪潮| 一本久久a久久精品综合夜夜| 久久99精品国产99久久6男男| 成人综合伊人五月婷久久| 日韩精品久久无码中文字幕 | 精品久久久中文字幕人妻| 色偷偷91久久综合噜噜噜噜| 亚洲国产精品嫩草影院久久| 青青热久久国产久精品| 综合久久精品色| 久久久久久久久波多野高潮| 伊人久久大香线蕉av不卡 | 亚洲狠狠婷婷综合久久蜜芽 | 国产午夜免费高清久久影院| WWW婷婷AV久久久影片| 久久久久久久综合日本亚洲| 久久精品成人免费观看97| 亚洲欧美久久久久9999| 久久夜色精品国产噜噜麻豆| 久久精品国产一区二区三区日韩| 国内精品久久久久久中文字幕| 久久丝袜精品中文字幕| 婷婷久久香蕉五月综合加勒比| 久久99国产精品久久| 伊人久久精品影院| 国内精品久久久久影院一蜜桃| 久久久久亚洲AV成人网人人网站| 久久精品国产亚洲av麻豆蜜芽| 精品999久久久久久中文字幕| 久久久人妻精品无码一区| 国产亚洲精久久久久久无码77777| 中文字幕热久久久久久久| 品成人欧美大片久久国产欧美| 日本亚洲色大成网站WWW久久| 久久久久无码精品国产| 国产成人AV综合久久| 久久久无码人妻精品无码| 欧美一区二区久久精品|