HDU 5879 Cure【数论】

Cure

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

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→∞，sum=pi*pi/6;

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<climits>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
typedef long long LL;
const int INF=0x7ffffff;

const int M=1e6+1;
char c[M];
double sum[M];
int i,j,k,n,m;

int main()
{
    MS(sum,0);
    for(i=1;i<=999999;i++){
        sum[i]=sum[i-1]+(double)1.0/i/i;
      }
   while(~scanf("%s",c)){
       int len=strlen(c);
       if(len>=7)printf("1.64493\n");
       else {
         n=0;
        for(i=0;i<len;i++)
           n=n*10+(c[i]-'0');
       printf("%.5lf\n",sum[n]);
       }
   }
   return 0;
}