Description
Known: Sn = 1+1/2+1/3+...+1/n. Obviously for any integer K, when n is large enough, Sn is greater than K.
Now given an integer K (1<=k<=15), it is required to calculate a minimum n; making Sn>K.
Enter
an integer K.
Output
an integer n.
Sample input
1
Sample output
2
#include <iostream>
using namespace std;
int main()
{
int k, n=1;
double sum=0;
cin>>k;
while(1)
{
sum += (1.0)/n;
if(sum > k)
{
break;
} else
{
n++;
}
}
cout<<n<<endl;
return 0;
}