NYOJ 921 分数矩阵【数学题】

http://acm.nyist.net/JudgeOnline/problem.php?pid=921

#include<stdio.h>
double arr[50000]={0,1};
int main()
{
	int N,i;
	double sum=1;
	for(i=2;i<50000;i++)
	{
		sum += 2*1.0/i;
		arr[i]=arr[i-1]+sum;
	}
	
	while(scanf("%d",&N),N)
	{
		printf("%.2lf\n",arr[N]);
	}
	return 0;
}