joj2282

All

2282: The Minimum Integer

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	1006	436	Standard

One day, sharang and mike was trying to solve a hard problem in our club SAN JIAO, but they had to known the minimum integer n make the S(n) grater than a integer K, which S(n) = 1 + 1/2 + 1/3 + ... + 1/n. Can you help them?

Input

There are several lines in the input, each line consits of a integer K (1 <= K <= 15).

Output

Please output the minimum integer n in each line, such that S(n) > K.

Sample Input

1

Sample Output

2

---

This problem is used for contest: 43 

---

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

 

 

 

 

 

 

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    double  k;
    while(scanf("%lf",&k)==1)
    {
        double n=1;
        double sum=0;
        while(sum<=k)
        {
            sum=sum+1/n;
            n=n+1;
        }
        cout<<n-1<<endl;
    }
    return 0;
}