HDU5879-Cure

Cure

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

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
  
  

 

Source

2016 ACM/ICPC Asia Regional Qingdao Online

题意：输入n，输出 1/(1^2) + 1/(2^2) + … + 1/(n^2)

解题思路：题目会出现负数，取绝对值。300000之后数都不会变了。那么大于300000的直接输出300000的值就好。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>

using namespace std;

#define ll long long

double dp[300009],sum=0,t;

int main()
{
    dp[0]=0;
    for(ll i=1;i<=300000;i++)
    {
        t=1.0/(i*i);
        sum+=t;
        dp[i]=sum;
    }
    ll n;
    while(~scanf("%lld",&n))
    {
        if(n<0) n=-n;
        if(n>=300000) n=300000;
        printf("%.5lf\n",dp[n]);
    }
    return 0;
}