* 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
1.3 KiB
Markdown
49 lines
1.3 KiB
Markdown
---
|
||
id: 5900f4971000cf542c50ffaa
|
||
title: 问题299:三个相似的三角形
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-299-three-similar-triangles
|
||
---
|
||
|
||
# --description--
|
||
|
||
选择了四个具有整数坐标的点:A(a,0),B(b,0),C(0,c)和D(0,d),
|
||
|
||
其中0
|
||
|
||
仅当a = c时,容易证明三个三角形可以相似。
|
||
|
||
因此,给定a = c,我们正在寻找三元组(a,b,d),使得AC上至少存在一个点P(具有整数坐标),从而使三个三角形ABP,CDP和BDP都相似。
|
||
|
||
例如,如果(a,b,d)=(2,3,4),则可以容易地验证点P(1,1)满足上述条件。 请注意,三点式(2,3,4)和(2,4,3)被认为是截然不同的,尽管点P(1,1)对于两者而言是共同的。
|
||
|
||
如果b + d <100,则存在92个不同的三元组(a,b,d),从而存在点P. 如果b + d <100000,则存在320471个不同的三元组(a,b,d),从而存在点P. 如果b + d <100000000,那么有几个不同的三元组(a,b,d)使得点P存在?
|
||
|
||
# --hints--
|
||
|
||
`euler299()`应该返回549936643。
|
||
|
||
```js
|
||
assert.strictEqual(euler299(), 549936643);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler299() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler299();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|