亚洲免费在线-亚洲免费在线播放-亚洲免费在线观看-亚洲免费在线观看视频-亚洲免费在线看-亚洲免费在线视频

HangOver

系統(tǒng) 2033 0

HangOver

Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7693????Accepted Submission(s): 3129


Problem Description

How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicular to the table.) With two cards you can make the top card overhang the bottom one by half a card length, and the bottom one overhang the table by a third of a card length, for a total maximum overhang of 1/2 + 1/3 = 5/6 card lengths. In general you can make n cards overhang by 1/2 + 1/3 + 1/4 + ... + 1/(n + 1) card lengths, where the top card overhangs the second by 1/2, the second overhangs tha third by 1/3, the third overhangs the fourth by 1/4, etc., and the bottom card overhangs the table by 1/(n + 1). This is illustrated in the figure below.

?

The input consists of one or more test cases, followed by a line containing the number 0.00 that signals the end of the input. Each test case is a single line containing a positive floating-point number c whose value is at least 0.01 and at most 5.20; c will contain exactly three digits.

For each test case, output the minimum number of cards necessary to achieve an overhang of at least c card lengths. Use the exact output format shown in the examples.

?

?

Sample Input

1.00 3.71 0.04 5.19 0.00

?

?

Sample Output

3 card(s) 61 card(s) 1 card(s) 273 card(s)

?

?

Source

Mid-Central USA 2001

?

題目沒什么難度,分明就是某年NOIP的級數(shù)求和,不過題目里如果不說,我還真不一定能想到,這個(gè)結(jié)論得記一下.

      #include<stdio.h>
      
        

#include
      
      <
      
        string
      
      .h>


      
        int
      
       f[
      
        1024
      
      
        ];


      
      
        double
      
       s[
      
        1024
      
      
        ];


      
      
        void
      
      
         getprepared()

{

    memset(f,
      
      
        0
      
      ,
      
        sizeof
      
      
        (f));

    memset(s,
      
      
        0
      
      ,
      
        sizeof
      
      
        (s));

    s[
      
      
        1
      
      ]=
      
        0.5
      
      
        ;

    
      
      
        for
      
       (
      
        int
      
       i=
      
        2
      
      ;i<=
      
        1000
      
      ;i++) s[i]=s[i-
      
        1
      
      ]+
      
        1.0
      
      /(i+
      
        1
      
      
        );

    
      
      
        for
      
       (
      
        int
      
       i=
      
        1
      
      ;i<=
      
        520
      
      ;i++
      
        )

    {

        
      
      
        double
      
       x=i/
      
        100.0
      
      
        ;

        
      
      
        for
      
       (
      
        int
      
       j=
      
        1
      
      ;j<=
      
        1000
      
      ;j++
      
        )

        
      
      
        if
      
       (s[j]>=
      
        x)

        {

            f[i]
      
      =
      
        j;

            
      
      
        break
      
      
        ;

        }

    }

}


      
      
        int
      
      
         main()

{

    getprepared();

    
      
      
        double
      
      
         ss;

    
      
      
        while
      
       (scanf(
      
        "
      
      
        %lf
      
      
        "
      
      ,&ss)!=
      
        EOF)

    {

        
      
      
        if
      
       (ss==
      
        0
      
      ) 
      
        return
      
      
        0
      
      
        ;

        
      
      
        int
      
       x=
      
        100
      
      *
      
        ss;

        printf(
      
      
        "
      
      
        %d card(s)\n
      
      
        "
      
      
        ,f[x]);

    }

    
      
      
        return
      
      
        0
      
      
        ;

}
      
    

?

HangOver


更多文章、技術(shù)交流、商務(wù)合作、聯(lián)系博主

微信掃碼或搜索:z360901061

微信掃一掃加我為好友

QQ號聯(lián)系: 360901061

您的支持是博主寫作最大的動(dòng)力,如果您喜歡我的文章,感覺我的文章對您有幫助,請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧,狠狠點(diǎn)擊下面給點(diǎn)支持吧,站長非常感激您!手機(jī)微信長按不能支付解決辦法:請將微信支付二維碼保存到相冊,切換到微信,然后點(diǎn)擊微信右上角掃一掃功能,選擇支付二維碼完成支付。

【本文對您有幫助就好】

您的支持是博主寫作最大的動(dòng)力,如果您喜歡我的文章,感覺我的文章對您有幫助,請用微信掃描上面二維碼支持博主2元、5元、10元、自定義金額等您想捐的金額吧,站長會(huì)非常 感謝您的哦!!!

發(fā)表我的評論
最新評論 總共0條評論
主站蜘蛛池模板: 国产资源福利 | 久久久久久青草大香综合精品 | 九九夜夜操妹子 | 亚洲国产一级a毛片 | 日韩城人免费 | 色综合色综合色综合色综合 | 春色www在线视频观看 | 99久久免费观看 | 天天狠天天操 | 日韩日b视频 | 夜色私人影院永久地址入口 | 人成午夜欧美大片免费视频 | 国产se| 免费播放国产一级 | 牛牛精品 | 亚洲干综合 | 四虎永久免费观看紧急入口 | 伊人午夜 | a性视频| 久久综合五月天 | 成人亚洲精品一区二区 | 国产精品自在欧美一区 | 亚洲国产男人本色在线观看的a站 | 精品视频在线免费 | 国产精品嫩草研究所永久网址 | 免费操片 | 一级毛毛片 | 色综合久久综合欧美综合网 | 超碰小说 | 国产成人a毛片在线 | 四虎视频国产精品免费 | 久久天天躁狠狠躁夜夜躁 | 99久久精品毛片免费播放 | 午夜精品久久久久久久四虎 | 亚洲mv| 高清在线一区二区三区亚洲综合 | 国产福利一区二区三区在线视频 | 国产精品久久久久国产精品三级 | 99久久免费精品国产免费 | 一区二区三区毛片免费 | 欧洲色网 |