LightOJ 1234 Harmonic Number

最新推荐文章于 2017-09-29 20:54:16 发布

cc_wood

最新推荐文章于 2017-09-29 20:54:16 发布

阅读量398

点赞数

分类专栏：算法之数学文章标签： lightoj numbers

本文链接：https://blog.csdn.net/cccruel/article/details/76294144

版权

算法之数学专栏收录该内容

69 篇文章 2 订阅

订阅专栏

题目链接:点我

In mathematics, the nth harmonic number is the sum of the reciprocals of the first n natural numbers:

In this problem, you are given n, you have to find Hn.

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 108).

Output

For each case, print the case number and the nth harmonic number. Errors less than 10-8 will be ignored.

Sample Input

Sample Output

Case 1: 1

Case 2: 1.5

Case 3: 1.8333333333

Case 4: 2.0833333333

Case 5: 2.2833333333

Case 6: 2.450

Case 7: 2.5928571429

Case 8: 2.7178571429

Case 9: 2.8289682540

Case 10: 18.8925358988

Case 11: 18.9978964039

Case 12: 18.9978964139

题意:

求调和级数的前n项和

思路:

调和级数求和的公式:ans = $log_{10} n$ + C + 1.0 / (2 * n); 这里的
C =0.57721566490153286060651209 ,不过这个公式在n毕竟小的时候不准确,所以我们在n比较小的时候直接暴力,n比较大的时候用公式.

代码:

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

double C = 0.57721566490153286060651209;
const int maxn = 1e6 + 10;
double a[maxn];

void init(){
    a[1] = 1;
    for(int i = 2; i <= 1e6; ++i)
        a[i] = a[i-1]+ 1.0 / i;
}

int main(){
    int t;
    init();
    scanf("%d", &t);
    int kase = 0;
    while(t-- ){
        int n;
        scanf("%d",&n);
        printf("Case %d: ", ++kase);
       if(n <= 1e6){
        printf("%.10f\n", a[n]);
       }else {
        printf("%.10f\n", log(n) + C + 1.0 / ( 2 * n) );
       }
    }
    return 0;
}