topic 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; make Sn>K.
enter
input k
output
output n
sample input
1
sample output
2
Above code:
#include <stdio.h>
int main()
{
double s = 0;
int i;
int k;
scanf("%d",&k);
for(i = 1; ; i ++)
{ s+=1.0/i;
if(s>k)
break;
}
printf("%d", i);
return 0;
}
Remember to follow + like