freeCodeCamp/problem-323-bitwise-or-operations-on-random-integers.chinese.md at 3ee1c39e41c1aae3b0b23b3e79fba3ec1aae1989

Files

Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220 )

* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions

2020-03-03 18:49:47 +05:30

1.1 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f4b01000cf542c50ffc2	5	Problem 323: Bitwise-OR operations on random integers		问题323：对随机整数进行按位或运算

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位。

Instructions

Tests

tests:
  - text: <code>euler323()</code>应该返回6.3551758451。
    testString: assert.strictEqual(euler323(), 6.3551758451);

Challenge Seed

function euler323() {
  // Good luck!
  return true;
}

euler323();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape