56 lines
1.6 KiB
Markdown
56 lines
1.6 KiB
Markdown
---
|
||
id: 5900f3d61000cf542c50fee8
|
||
challengeType: 5
|
||
title: 'Problem 105: Special subset sums: testing'
|
||
videoUrl: ''
|
||
localeTitle: 问题105:特殊子集总和:测试
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设S(A)表示大小为n的集合A中的元素之和。如果对于任何两个非空的不相交子集B和C,我们将其称为特殊和集合,以下属性为真:S(B)≠S(C);也就是说,子集的总和不能相等。如果B包含的元素多于C,则S(B)> S(C)。例如,{81,88,75,42,87,84,86,65}不是一个特殊的和集,因为65 + 87 + 88 = 75 + 81 + 84,而{157,150,164,119,79 ,159,161,139,158}满足所有可能的子集对组合的规则,并且S(A)= 1286.使用sets.txt(右键单击并“将链接/目标另存为...”),4K文本文件包含七到十二个元素的一百个集合(上面给出的两个例子是文件中的前两个集合),识别所有特殊的和集,A1,A2,...,Ak,并找到S的值( A1)+ S(A2)+ ... + S(Ak)。注意:此问题与问题103和问题106有关。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler105()</code>应返回73702。
|
||
testString: 'assert.strictEqual(euler105(), 73702, "<code>euler105()</code> should return 73702.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler105() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler105();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|