61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
57 lines
1.1 KiB
Markdown
57 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4ef1000cf542c510001
|
||
challengeType: 5
|
||
title: 'Problem 386: Maximum length of an antichain'
|
||
videoUrl: ''
|
||
localeTitle: 问题386：反链的最大长度
|
||
---
|
||
|
||
## Description
|
||
<section id="description">令n为整数，S（n）为n的因子集。 <p>如果A仅包含一个元素，或者如果A的元素中没有一个除以A的任何其他元素，则S（n）的子集A被称为S（n）的反共。 </p><p>例如：S（30）= {1,2,3,5,6,10,15,30} {2,5,6}不是S（30）的反链。 {2,3,5}是S（30）的反链。 </p><p>设N（n）为S（n）的反链的最大长度。 </p><p>找ΣN（n）为1≤n≤108 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler386()</code>应该返回528755790。
|
||
testString: assert.strictEqual(euler386(), 528755790);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler386() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler386();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|