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>
49 lines
773 B
Markdown
49 lines
773 B
Markdown
---
|
||
id: 5900f53e1000cf542c510051
|
||
title: 问题466：乘法表中的不同术语
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-466-distinct-terms-in-a-multiplication-table
|
||
---
|
||
|
||
# --description--
|
||
|
||
令P（m，n）为m×n乘法表中的不同项的数量。
|
||
|
||
例如，3×4乘法表如下所示：
|
||
|
||
×12341 12342 24683 36912
|
||
|
||
有8个不同的术语{1,2,3,4,6,8,9,12}，因此P（3,4）= 8。
|
||
|
||
给出：P（64,64）= 1263，P（12,345）= 1998，P（32,1015）= 13826382602124302。
|
||
|
||
求P（64,1016）。
|
||
|
||
# --hints--
|
||
|
||
`euler466()`应该返回258381958195474750。
|
||
|
||
```js
|
||
assert.strictEqual(euler466(), 258381958195474750);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler466() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler466();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|