8 static int ff[MAX] = { 1 };
19 for (int k=0; k<=d; k++)
30 static int nn[MAX][MAX];
38 nn[z][d] = z*n0(z-1,d-1) + (d-z)*n0(z,d-1);
45 for (int i=0; i<MAX; i++)
48 for (int i=0; i<MAX; i++)
51 for (int j=0; j<MAX; j++)
54 printf("%d", n0(i, j));
61 for (int i=0; i<MAX; i++)
64 for (int j=0; j<MAX; j++)
68 double d = (double)(n0(i-1,j)-n0(i,j))/n0(i,j);