• <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
            哈哈哈哈哈哈
            美女久久久久久| 日批日出水久久亚洲精品tv| 亚洲性久久久影院| 亚洲精品无码成人片久久| 久久偷看各类wc女厕嘘嘘| 狠狠色噜噜狠狠狠狠狠色综合久久 | 精品一区二区久久久久久久网站| 久久不见久久见免费视频7| 亚洲国产精品久久久久婷婷老年| 久久久精品人妻无码专区不卡| 色狠狠久久综合网| 国产人久久人人人人爽| 色婷婷噜噜久久国产精品12p| 7777精品久久久大香线蕉| 久久综合久久综合久久| 久久久久久久女国产乱让韩| 国产亚洲欧美成人久久片| 久久这里有精品视频| 久久国产免费观看精品| 超级97碰碰碰碰久久久久最新| 久久ZYZ资源站无码中文动漫| 久久青青国产| 国产精品久久久久乳精品爆| 久久香蕉超碰97国产精品| 性做久久久久久免费观看| 99久久国产免费福利| 精品久久久久久| 国产亚洲综合久久系列| 午夜天堂av天堂久久久| 久久久久久久免费视频| 亚洲精品国产综合久久一线| 久久中文娱乐网| 99久久伊人精品综合观看| 狠狠色丁香婷综合久久| 久久久久AV综合网成人| 少妇人妻综合久久中文字幕| 久久国产成人| 久久天天躁狠狠躁夜夜不卡 | 国产福利电影一区二区三区,免费久久久久久久精 | 日韩人妻无码精品久久免费一| 色播久久人人爽人人爽人人片AV|