freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
Oliver Eyton-Williams ee1e8abd87
feat(curriculum): restore seed + solution to Chinese (#40683)
* 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>
2021-01-12 19:31:00 -07:00

881 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f4b01000cf542c50ffc2 问题323对随机整数进行按位或运算 5 problem-323-bitwise-or-operations-on-random-integers

--description--

令y0y1y2...是随机无符号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