8 static int ff[MAX] = { 1 };
20 for (int i=1; i<=k; i++)
33 for (int k=0; k<=d; k++)
44 static int nn[MAX][MAX];
52 nn[z][d] = z*n0(z-1,d-1) + (d-z)*n0(z,d-1);
57 // Vzorecek ze Stanleyho
62 for (int k=0; k<=z; k++)
64 r += p * f(d-k) * c(z,k);
75 for (int i=1; i<=n; i++)
85 printf("Satnarka obema zpusoby:\n");
86 for (int i=1; i<MAX; i++)
87 printf("%d\t%d\t%f\n", i, s(i), f(i)*alpha(i));
90 printf("n0(i-1,i) pomoci alpha(i) a s(i):\n");
91 for (int i=2; i<MAX; i++)
92 printf("%d\t%f\t%f\n", i, f(i-1) * (i*alpha(i-1) + alpha(i-2)), s(i)*(1+1./i));
95 printf("Rekurence pro n0 dava:\n");
96 for (int i=0; i<MAX; i++)
99 for (int i=0; i<MAX; i++)
102 for (int j=0; j<MAX; j++)
105 printf("%d", n0(i, j));
112 printf("Totez podle vzorecku ze Stanleyho:\n");
113 for (int i=0; i<MAX; i++)
116 for (int j=0; j<MAX; j++)
119 printf("%d", s0(i, j));
126 printf("Rozdily:\n");
127 for (int i=0; i<MAX; i++)
130 for (int j=0; j<MAX; j++)
133 printf("%d", n0(i-1,j)-n0(i,j));
140 for (int i=0; i<MAX; i++)
143 for (int j=0; j<MAX; j++)
147 double d = (double)n0(i-1,j)/(n0(i-1,j)-n0(i,j));