线上OJ:
一本通:1918:【02NOIP普及组】级数求和 (opens in a new tab)
AcWing:5490. 级数求和 (opens in a new tab)
洛谷:P1035 [NOIP2002 普及组] 级数求和 (opens in a new tab)
核心算法:暴力模拟
备注:此类题,考场上也可以考虑 打表
题解代码:
#include <bits/stdc++.h>
using namespace std;
int k, n = 0;
double s = 0;
int main()
{
scanf("%d", &k);
while(s <= k)
{
n++;
s += 1/((double)n);
}
printf("%d\n", n);
return 0;
}