显示代码纯文本
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
const int SIZEN=1010,SIZEC=110;
int c,n,m;
double f[SIZEN][SIZEC]={0};
bool work(void){
scanf("%d",&c);
if(!c) return false;
scanf("%d%d",&n,&m);
if(m>n||m>c||((n-m)&1)){
printf("0.000\n");
return true;
}
memset(f,0,sizeof(f));
f[0][0]=1;
if(n>1000) n=1000+(n&1);
for(int i=1;i<=n;i++){
for(int j=0;j<=c;j++){
f[i][j]+=f[i-1][j+1]*(j+1.0)/(c+0.0);
if(j>0) f[i][j]+=f[i-1][j-1]*(c-j+1.0)/(c+0.0);
}
}
printf("%.3lf\n",f[n][m]);
return true;
}
int main(){
freopen("poj1322_chocolate.in","r",stdin);
freopen("poj1322_chocolate.out","w",stdout);
while(work());
return 0;
}