【调和级数求和公式】【欧拉常数】I - Harmonic Number

题意：

　　　求1+1/2+1/3+…+1/n

---

欧拉常数值：C≈0.57721566490153286060651209

求和公式：S(n)=ln(n)+C+1/(2*n)

公式只对n值很大的数有效

( C++　cmath库中log(n)就是ln(n) )

#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<unordered_map>
#pragma GCC optimize(2)
#define debug cout<<"*"<<endl;
#define in(x) scanf("%d",&x)
#define out(x) printf("%d\n",x)
#define llin(x) scanf("%lld",&x)
#define llout(x) printf("%lld\n",x)
using namespace std;
typedef long long ll;
typedef __int128 Biginteger;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<string,int> psi;
typedef pair<char,char> pcc;
const ll mod=14937;
const ll INF=0x3f3f3f3f3f;
const int maxn=1e6+17;
const int base=233;
const double PI=acos(-1);
const double euler_cons=0.57721566490153286060651209;
const int N=4;

double ans[maxn];
void pre()
{
    ans[1]=1.0;
    for(int i=2;i<=maxn;++i)
    {
        ans[i]=ans[i-1]+1.0/(double)i;
    }
}
int main()
{
    pre();
    int t;
    in(t);
    int cas=0;
    while(t--)
    {
        int n;
        in(n);
        printf("Case %d: ",++cas);
        if(n<maxn)    //n不大时直接打表求出来，因为n不大时公式不对
        printf("%.10lf\n",ans[n]);
        else
        printf("%.10lf\n",log(n)+euler_cons+1.0/(2*n));
    }
    return 0;
}