LightOJ 1234 Harmonic Number 分布式打表

#pragma comment(linker,"/STACK:1024000000,1024000000")
#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<string>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<vector>
#include<fstream>
#include<list>
using namespace std;

#define ms(s) memset(s,0,sizeof(s))
typedef unsigned long long ULL;
typedef long long LL;

const int INF = 0x3fffffff;

double num[1000010];

int main()
{
//    freopen("F:\\input.txt","r",stdin);
//    freopen("F:\\output.txt","w",stdout);
//    ios::sync_with_stdio(false);

ms(num);
int t;
int n;
double ans = 0;
for(int i = 1; i <= 100000000; ++i){
ans += 1.0/(double)i;
if(i%100 == 0)
num[i/100] = ans;
}
scanf("%d",&t);
for(int cas = 1; cas <= t; ++cas){
scanf("%d",&n);
ans = num[n/100];
for(int i = n/100*100+1; i <= n; ++i){
ans += 1.0/(double)i;
}
printf("Case %d: %.10f\n",cas,ans);
}

return 0;
}