65 lines
1.1 KiB
Markdown
65 lines
1.1 KiB
Markdown
---
|
|
id: 5900f43f1000cf542c50ff51
|
|
challengeType: 5
|
|
title: 'Problem 208: Robot Walks'
|
|
forumTopicId: 301849
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
A robot moves in a series of one-fifth circular arcs (72°), with a free choice of a clockwise or an anticlockwise arc for each step, but no turning on the spot.
|
|
|
|
One of 70932 possible closed paths of 25 arcs starting northward is
|
|
|
|
|
|
|
|
Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position?
|
|
(Any arc may be traversed multiple times.)
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler208()</code> should return 331951449665644800.
|
|
testString: assert.strictEqual(euler208(), 331951449665644800);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler208() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler208();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|