• <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
            哈哈哈哈哈哈
            欧洲精品久久久av无码电影| 久久精品无码午夜福利理论片| 国产成人精品白浆久久69| 亚洲精品乱码久久久久久不卡| 97久久精品人人澡人人爽| 91精品国产综合久久婷婷| 精品蜜臀久久久久99网站| 久久99久久99小草精品免视看| 久久精品国产免费| 国产精品丝袜久久久久久不卡| 国产精品免费久久| 久久精品免费大片国产大片| 欧美一级久久久久久久大| 香蕉久久夜色精品国产尤物| 亚洲中文字幕无码久久综合网| 一本色道久久88—综合亚洲精品 | 国产精品久久久久影院嫩草| 99麻豆久久久国产精品免费| 99精品久久久久久久婷婷| 日本亚洲色大成网站WWW久久| 影音先锋女人AV鲁色资源网久久| 久久久无码精品亚洲日韩蜜臀浪潮| av无码久久久久久不卡网站| 国产成人无码精品久久久久免费 | 亚洲中文字幕无码久久2017 | 色综合久久中文字幕综合网| 狠狠色丁香久久婷婷综合蜜芽五月 | 东方aⅴ免费观看久久av| WWW婷婷AV久久久影片| 久久国产美女免费观看精品| 久久福利资源国产精品999| 日本三级久久网| 日本欧美国产精品第一页久久| 97精品国产97久久久久久免费| 国产精品久久久久9999| 亚洲精品无码久久久| 国产精品久久波多野结衣| 久久精品国产精品亚洲| 久久精品国产亚洲av水果派 | 一本色道久久HEZYO无码| 免费精品99久久国产综合精品|