56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f4371000cf542c50ff49
|
||
challengeType: 5
|
||
title: 'Problem 202: Laserbeam'
|
||
videoUrl: ''
|
||
localeTitle: 问题202:Laserbeam
|
||
---
|
||
|
||
## Description
|
||
<section id="description">三个镜子以等边三角形的形状排列,其反射表面指向内侧。在三角形的每个顶点处存在无穷小的间隙,激光束可以通过该间隙。 <p>标记顶点A,B和C.有两种方式可以使激光束进入顶点C,从11个表面反弹,然后通过相同的顶点退出:下面显示了一种方式;另一方面与此相反。 </p><p>有80840种方式,激光束可以进入顶点C,从1000001表面反弹,然后通过相同的顶点退出。 </p><p>激光束在顶点C进入的方式有多少,从12017639147表面反弹,然后通过相同的顶点退出? </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler202()</code>应返回1209002624。
|
||
testString: 'assert.strictEqual(euler202(), 1209002624, "<code>euler202()</code> should return 1209002624.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler202() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler202();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|