递推 hdu 1330

2024-03-28 10:34:20

http://www.cnblogs.com/rainydays/archive/2013/01/16/2862235.html

看样例的答案

#include<stdio.h>

#include<string.h>

#include<algorithm>

#include<math.h>

using namespace std;

typedef long long ll;

#define MAXN 100010

double z[MAXN];

int main()

{

    z[]=0.5;

    for(int i=;i<MAXN;i++)

        z[i]=z[i-]+1.0/(i*);

    int n;

    printf("# Cards  Overhang\n");

    while(scanf("%d",&n)!=EOF)

    {

        printf("%5d%10.3lf\n",n,z[n]);

    }

    return  ;

}

最新文章

热门文章