• <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
            哈哈哈哈哈哈
            狠狠久久综合伊人不卡| 久久精品日日躁夜夜躁欧美| 久久国产亚洲精品无码| 无码伊人66久久大杳蕉网站谷歌| 无遮挡粉嫩小泬久久久久久久| 九九精品99久久久香蕉| 国产99久久久国产精品~~牛 | 日韩欧美亚洲综合久久影院Ds| 久久久亚洲AV波多野结衣| 久久亚洲精品成人av无码网站| 国产精品成人精品久久久| 久久综合九色综合网站| 亚洲国产精品婷婷久久| 亚洲精品蜜桃久久久久久| 国内精品久久久久久久久电影网| 国产精品久久新婚兰兰| 亚洲国产二区三区久久| 亚洲欧美伊人久久综合一区二区 | 国内精品人妻无码久久久影院 | 精品久久久久久久久久中文字幕 | 久久精品亚洲乱码伦伦中文| 99精品国产99久久久久久97| 精品无码人妻久久久久久 | 色综合久久综精品| 亚洲伊人久久精品影院| 欧美激情精品久久久久久久九九九| 国产精品久久久久久吹潮| 久久精品久久久久观看99水蜜桃| 久久精品国产亚洲Aⅴ香蕉| 成人久久综合网| 久久超碰97人人做人人爱| 色欲久久久天天天综合网| 波多野结衣AV无码久久一区| 亚洲人成无码www久久久| 久久频这里精品99香蕉久| 久久精品国产清自在天天线| 国产精品热久久毛片| 国产成人精品久久亚洲高清不卡 | 色综合久久最新中文字幕| 国产成人综合久久久久久| 国产一区二区精品久久岳|