题目:
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 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).
输出:
For each case, print the case number and the nth harmonic number. Errors less than 10-8 will be ignored.
样例输入:
12
1
2
3
4
5
6
7
8
9
90000000
99999999
100000000
样例输出:
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
这个题就是根据公式来求,但是要是直接求的话会超时,所以建一个数组,隔一部分都这部分的和存下来,就会节省很多时间
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
double s[2000010];
void aa()
{
double a=0;
for(int i=1;i<100000010;i++)
{
a+=(1.0/i);
if(i%50==0)//隔50个数,把这些数加起来
s[i/50]=a;//第一个50是s[1],第二个50是s[2]。以此类推
}
}
int main()
{
aa();
int t;
scanf("%d",&t);
int ans=1;
while(t--)
{
double n;
scanf("%lf",&n);
double sum=1.0;
int x=n/50;
sum=s[x];
for(int i=50*x+1;i<=n;i++)//如果这个数大于50,那sum直接就是前50个数的和,如果不是,就一个一个的加
{
sum+=(1.0/i);
}
printf("Case %d: %.10lf\n",ans++,sum);
}
return 0;
}