#include <stdio.h> int main()
{
double table[];
double t=2.0;
table[]=0.5; for(int i=;i<;i++)
{
t+=;
table[i]=table[i-]+1.0/t;
} printf("# Cards Overhang\n");
int n;
while(scanf("%d",&n)!=EOF)
{
printf("%5d%10.3lf\n",n,table[n]);
} return ;
}
相关文章
- ZOJ Problem Set - 1383 Binary Numbers
- ZOJ Problem Set - 1201 Inversion
- ZOJ Problem Set - 1730 Crazy Tea Party
- ZOJ Problem Set - 1241 Geometry Made Simple
- ZOJ Problem Set - 3329(概率DP)
- ZOJ Problem Set - 1048 Financial Management
- ZOJ Problem Set - 3640 Help Me Escape
- ZOJ Problem Set - 1045 HangOver
- ZOJ 1216 Deck
- ZOJ Problem Set - 1350 The Drunk Jailer ac代码 memset