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>
43 lines
790 B
Markdown
43 lines
790 B
Markdown
---
|
||
id: 5900f43f1000cf542c50ff51
|
||
title: 问题208：机器人走路
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-208-robot-walks
|
||
---
|
||
|
||
# --description--
|
||
|
||
机器人以一系列五分之一圆弧（72°）移动，每个步骤可自由选择顺时针或逆时针弧，但不能转动现场。
|
||
|
||
从北向南开始的70932条可能的闭合路径之一是
|
||
|
||
鉴于机器人开始面向北方，在最终弧线之后，可以将多少70个弧长的行程返回到其起始位置？ （任何弧都可以多次遍历。）
|
||
|
||
# --hints--
|
||
|
||
`euler208()`应该返回331951449665644800。
|
||
|
||
```js
|
||
assert.strictEqual(euler208(), 331951449665644800);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler208() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler208();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|