ZOJ Problem Set - 1216 Deck

#include <stdio.h>

int main()
{
    double table[100001];
    double t=2.0;
    table[1]=0.5;
    
    for(int i=2;i<100001;i++)
    {
        t+=2;
        table[i]=table[i-1]+1.0/t;
    }

    printf("# Cards  Overhang\n");
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        printf("%5d%10.3lf\n",n,table[n]); 
    }

    return 0;
}

 

posted @ 2013-09-17 22:50  xlturing  阅读(229)  评论(0编辑  收藏  举报