56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
||
id: 5900f4e81000cf542c50fffa
|
||
challengeType: 5
|
||
title: 'Problem 379: Least common multiple count'
|
||
videoUrl: ''
|
||
localeTitle: 问题379：最少共同的多重计数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设f（n）为具有x和y正整数的耦合数（x，y），x≤y，x和y的最小公倍数等于n。 <p>令g为f的求和函数，即：g（n）=Σf（i），1≤i≤n。 </p><p>你得到g（106）= 37429395。 </p><p>找到g（1012）。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler379()</code>应该返回132314136838185。
|
||
testString: 'assert.strictEqual(euler379(), 132314136838185, "<code>euler379()</code> should return 132314136838185.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler379() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler379();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|