很好的题解:http://acm.uestc.edu.cn/bbs/read.php?tid=3698&page=1&toread=1#tpc
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
inline char nc()
{
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x)
{
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int maxn=1500;
double f[2][1600];
double ans[1600];
int main()
{
int Q,n;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
f[0][0]=1;
ans[0]=0; ans[1]=1;
for(int i=0,t=1;i<maxn;i++,t^=1)
{
memset(f[t],0,sizeof(f[t]));
for(int j=0;j<=i;j++)
{
f[t][j+1]+=f[t^1][j]*0.5;
f[t][max(j-1,0)]+=f[t^1][j]*0.5;
}
ans[i+2]=ans[i+1]+f[t][0];
}
read(Q);
for (int i=1;i<=Q;i++)
{
read(n);
printf("Case %d: %.6f\n",i,ans[n]+1e-10);
}
return 0;
}
找到个找规律的代码 短小精悍
#include<cstdio>
double a[1510],x;int k,n,t;main(){
for(a[1]=x=1,n=2;n<=1500;a[n]=a[n-1]+x,n++)if(~n&1)x=x*(n-1)/n;
for(scanf("%d",&t);t--;scanf("%d",&n),printf("Case %d: %lf\n",++k,a[n]+1e-10));
}