• <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
            哈哈哈哈哈哈
            久久青青草原精品国产| 伊人精品久久久久7777| 97超级碰碰碰碰久久久久| 99热精品久久只有精品| 日本精品久久久久影院日本| 伊人久久大香线蕉无码麻豆| 久久国产精品99精品国产| 999久久久免费国产精品播放| 日本欧美国产精品第一页久久| 久久午夜无码鲁丝片| 精品久久人人妻人人做精品| 丁香色欲久久久久久综合网| 久久99精品国产麻豆蜜芽| 久久大香香蕉国产| 久久综合久久美利坚合众国| 久久99国产亚洲高清观看首页| 区亚洲欧美一级久久精品亚洲精品成人网久久久久 | 伊人久久久AV老熟妇色| 99久久国产主播综合精品| 老色鬼久久亚洲AV综合| 开心久久婷婷综合中文字幕| 久久久国产精品网站| 国内精品伊人久久久久AV影院| 日本五月天婷久久网站| 色综合久久久久综合99| 久久人人爽人人爽人人片AV东京热| 久久精品国产亚洲av麻豆小说| 伊人久久国产免费观看视频| 国产精品99久久久久久宅男| 久久综合九色综合久99| 久久亚洲国产中v天仙www| 久久夜色精品国产网站| 中文字幕久久久久人妻| 亚洲中文字幕无码久久2020| 久久精品中文无码资源站| 99精品国产免费久久久久久下载| 欧美粉嫩小泬久久久久久久 | 国产成人精品久久| 国内精品欧美久久精品| 久久精品国产亚洲av瑜伽| 欧美午夜A∨大片久久|