HDU 5879 Cure （2016 ACM/ICPC Asia Regional Qingdao Online 1002）

Cure

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 484    Accepted Submission(s): 170

Problem Description

Given an integer  n , we only want to know the sum of  1/k2  where  k  from  1  to  n .

 

Input

There are multiple cases.
For each test case, there is a single line, containing a single positive integer  n . 
The input file is at most 1M.

 

Output

The required sum, rounded to the fifth digits after the decimal point.

 

Sample Input

  
  

   
   1
2
4
8
15
  
  

 

Sample Output

  
  

   
   1.00000
1.25000
1.42361
1.52742
1.58044
  
  

分析：n比较小的时候打表，把结果输出出来，当n比较大的时候值接近于π*π/6 ， 所以都是固定的。

这个题目没有说n是多大，所以，n要用字符串存储，然后判断位数来处理。

代码如下：

#include <stdio.h>
#include <string.h>
double a[200005];
char str[2000000];
int main()
{
	int i;
	long long n;

	a[0]=0;
	for(i=1;i<=200000;i++)
		a[i]=a[i-1]+1.0/i/i;
	while(~scanf("%s",str))
	{
		int len =strlen(str);
		if(len<=6)
		{
			n=0; 
			for(i=0;i<len;i++)
				n=n*10+ str[i]-'0';
			if(n<=200000)
				printf("%.5lf\n",a[n]);
			else
				printf("1.64493\n");
		} 
		else
			printf("1.64493\n");
		
	} 
	return 0;
}