小蜗牛

最新推荐文章于 2021-07-16 09:09:49 发布

Davenny

最新推荐文章于 2021-07-16 09:09:49 发布

阅读量328

点赞数

本文链接：https://blog.csdn.net/Davenny/article/details/51841554

版权

Description
Once upon a time, there was a poor snail. Every day, it tried very hard to crawl forward, while there was a keeper who’d like to maltreat this poor little snail. The snail was crawling on a one-meter rubber band at first, and it can move on k cm every minute. But after that, the keeper stretches the rubber band quickly, and it would be elongated one meter, during that the distances ratio between the snail and the two endpoints remain unchanged. In the next minute, little snail tried to keep moving forward again.
“Can I finally get to the endpoint?”
The snail often asked himself such a question because he was afraid he would never succeed. Now, we hope you can tell this poor snail when he would reach the endpoint.

Input
Every line of the input contains an integer number k, indicating that the snail moved forward k cm every minute. (5 <= k <= 100)

Output
Output an integer t, indicating that the snail doesn’t get to the endpoint until t-1 minutes later, while t minutes later, it finally succeed.

Sample Input
10
100

Sample Output
12367
1

#include <cstdio>
#include <iostream>
using namespace std;
int n,ans[109];
void init()
{
    ans[5]=272400600;
    ans[6]=9717617;
    ans[7]=898515;
    ans[8]=150661;
    ans[9]=37568;
    for(int i=10; i<=100; i++)
    {
        double t=0;
        double p=1;
        while(t<100)
        {
            t+=i/p++;
        }
        ans[i]=p-1;
    }
}
int main()
{
    init();
    while(scanf("%d",&n)!=EOF)
    {
        printf("%d\n",ans[n]);
    }
    return 0;
}