1.1 KiB
1.1 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4151000cf542c50ff28 | 5 | Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2 | 问题169:探索数字可以表示为2的幂之和的不同方式的数量 |
Description
Instructions
Tests
tests:
- text: <code>euler169()</code>应该返回178653872807。
testString: 'assert.strictEqual(euler169(), 178653872807, "<code>euler169()</code> should return 178653872807.");'
Challenge Seed
function euler169() {
// Good luck!
return true;
}
euler169();
Solution
// solution required