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多遍,也是醉了~~