ZOJ Problem Set - 1216 Deck

ZOJ Problem Set - 1216
Deck

#include<stdio.h>

int main(void)
{
    int n,i;

    printf("# Cards  Overhang\n");
    while (scanf("%d", &n) != EOF)
    {
        double result = 0.0;
        for (i = 1; i <= n; ++i)
            result += 1 / (double)i;
        result /= 2.0;
        printf("%5d%10.3lf\n", n,result);
        // %m.nf：输出共占m列，其中有n位小数，如数值宽度小于m左端补空格。
    }

    return 0;
}

如此水题居然提交n多遍，也是醉了~~