Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* 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>
2021-01-12 19:31:00 -07:00

45 lines
1.1 KiB
Markdown

---
id: 5900f4371000cf542c50ff49
title: 'Problem 202: Laserbeam'
challengeType: 5
forumTopicId: 301843
dashedName: problem-202-laserbeam
---
# --description--
Three mirrors are arranged in the shape of an equilateral triangle, with their reflective surfaces pointing inwards. There is an infinitesimal gap at each vertex of the triangle through which a laser beam may pass.
Label the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
There are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces, then exit through the same vertex.
In how many ways can a laser beam enter at vertex C, bounce off 12017639147 surfaces, then exit through the same vertex?
# --hints--
`euler202()` should return 1209002624.
```js
assert.strictEqual(euler202(), 1209002624);
```
# --seed--
## --seed-contents--
```js
function euler202() {
return true;
}
euler202();
```
# --solutions--
```js
// solution required
```