* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
881 B
881 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f4b01000cf542c50ffc2 | 问题323:对随机整数进行按位或运算 | 5 | problem-323-bitwise-or-operations-on-random-integers |
--description--
令y0,y1,y2,...是随机无符号32位整数的序列
(即0≤yi <232,每个值的可能性均等)。
对于序列xi,给出以下递归:x0 = 0且
xi = xi-1 | yi-1,对于i>0。(|是按位或运算符)
可以看出,对于所有i≥N,最终将存在一个索引N,使得xi = 232 -1(所有比特的位模式)。
找到N的期望值。 将答案四舍五入到小数点后10位。
--hints--
euler323()
应该返回6.3551758451。
assert.strictEqual(euler323(), 6.3551758451);
--seed--
--seed-contents--
function euler323() {
return true;
}
euler323();
--solutions--
// solution required