题目链接:
LightOJ 1234 Harmonic Number
题意:
求n级调和级数之和:h[n] = 1/1 + 1/2 + 1/3 + 1/4 +…+ 1/n。(n <= 1e8)。要求误差不超过1e-8.
分析;
找公式?
则当n > 1e6时可以用公式:
h[n]=(log(n * 1.0) + log(n + 1.0)/2.0 + 1.0/(6.0 * n * (n + 1)) - 1.0 / (30.0 * n * n * (n + 1) * (n + 1)) + r。
其中r为欧拉常数:
r=0.57721566490153286060651209008240243104215933593992
https://en.wikipedia.org/wiki/Euler%E2%80%93Mascheroni_constant
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <climits>
#include <cmath>
#include <ctime>
#include <cassert>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
typedef long long ll;
const double r = 0.57721566490153286060651209;
int T, cases = 0, n;
double solve(int x)
{
double res = 0;
for(int i = 1; i <= x; i++){
res += 1.0 / i;
}
return res;
}
double fun(int x)
{
double res = (log(x * 1.0) + log(x + 1.0)) / 2;
res += 1.0 / (6.0 * x * (x + 1));
res -= 1.0 / (30.0 * x * x * ( x + 1) * (x + 1));
return res + r;
}
int main()
{
scanf("%d", &T);
while(T--){
scanf("%d", &n);
double ans;
if(n <= 1000000) ans = solve(n);
else ans = fun(n);
printf("Case %d: %.10lf\n", ++cases, ans);
}
return 0;
}