56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f45f1000cf542c50ff71
|
||
challengeType: 5
|
||
title: 'Problem 242: Odd Triplets'
|
||
videoUrl: ''
|
||
localeTitle: 问题242：奇数三胞胎
|
||
---
|
||
|
||
## Description
|
||
<section id="description">给定集合{1,2，...，n}，我们将f（n，k）定义为具有奇数元素之和的k元素子集的数量。例如，f（5,3）= 4，因为集合{1,2,3,4,5}有四个3元素子集具有奇数元素，即：{1,2,4}，{ 1,3,5}，{2,3,4}和{2,4,5}。 <p>当所有三个值n，k和f（n，k）都是奇数时，我们说它们产生奇数三元组[n，k，f（n，k）]。 </p><p>正好有五个奇数三元组，n≤10，即：[1,1，f（1,1）= 1]，[5,1，f（5,1）= 3]，[5,5，f （5,5）= 1]，[9,1，f（9,1）= 5]和[9,9，f（9,9）= 1]。 </p><p> n≤1012，有多少奇数三胞胎？ </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler242()</code>应该返回997104142249036700。
|
||
testString: 'assert.strictEqual(euler242(), 997104142249036700, "<code>euler242()</code> should return 997104142249036700.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler242() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler242();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|