ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
45 lines
676 B
Markdown
45 lines
676 B
Markdown
---
|
||
id: 5900f4e81000cf542c50fffa
|
||
title: 问题379：最少共同的多重计数
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-379-least-common-multiple-count
|
||
---
|
||
|
||
# --description--
|
||
|
||
设f（n）为具有x和y正整数的耦合数（x，y），x≤y，x和y的最小公倍数等于n。
|
||
|
||
令g为f的求和函数，即：g（n）=Σf（i），1≤i≤n。
|
||
|
||
你得到g（106）= 37429395。
|
||
|
||
找到g（1012）。
|
||
|
||
# --hints--
|
||
|
||
`euler379()`应该返回132314136838185。
|
||
|
||
```js
|
||
assert.strictEqual(euler379(), 132314136838185);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler379() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler379();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|