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
984 B
Markdown
45 lines
984 B
Markdown
---
|
||
id: 5900f4371000cf542c50ff49
|
||
title: 问题202：Laserbeam
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-202-laserbeam
|
||
---
|
||
|
||
# --description--
|
||
|
||
三个镜子以等边三角形的形状排列，其反射表面指向内侧。在三角形的每个顶点处存在无穷小的间隙，激光束可以通过该间隙。
|
||
|
||
标记顶点A，B和C.有两种方式可以使激光束进入顶点C，从11个表面反弹，然后通过相同的顶点退出：下面显示了一种方式;另一方面与此相反。
|
||
|
||
有80840种方式，激光束可以进入顶点C，从1000001表面反弹，然后通过相同的顶点退出。
|
||
|
||
激光束在顶点C进入的方式有多少，从12017639147表面反弹，然后通过相同的顶点退出？
|
||
|
||
# --hints--
|
||
|
||
`euler202()`应返回1209002624。
|
||
|
||
```js
|
||
assert.strictEqual(euler202(), 1209002624);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler202() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler202();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|