s******r
发帖数: 5 | 1 it's for all i, requiring sum_{i=0}^{i=g-1} t_i = W
象 W = 32，M=4,
g can be 4, so t_i can be (8, 8, 8, 8)
g can be 3, so t_i can be (16, 8, 8)
g can be 2, so t_i can be ....
W 是变量， M也是变量，后来我把所有有可能满足条件的
组合归纳为
C1=1 - k(k-1)/2 + k*log(W/M), k为小于log(W/M)的最大整数
define x in set S(W, W-M, ....M) if x(mod M)=0;
and, for i in [0, g-1],
define condition1 as sum_{i=0}^{i=g-1} t_i=W;
define condition2 as t_i(mod M)=0;
不考虑条件1， 满足condition 2 的组合
C2=sum_{g=1}^{g=W(mod M)} (C_{W(mod M)}^{1})^g
Prob=(C1/C2)*(Sum |
|
