gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i8n,learn): processed translations

Browse Source
This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
View File

@ -1,22 +1,22 @@
---
id: 5900f43f1000cf542c50ff51
title: 问题208：机器人走路
title: 'Problem 208: Robot Walks'
challengeType: 5
videoUrl: ''
forumTopicId: 301849
dashedName: problem-208-robot-walks
---
# --description--
机器人以一系列五分之一圆弧（72°）移动，每个步骤可自由选择顺时针或逆时针弧，但不能转动现场。
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.
从北向南开始的70932条可能的闭合路径之一是
One of 70932 possible closed paths of 25 arcs starting northward is
鉴于机器人开始面向北方，在最终弧线之后，可以将多少70个弧长的行程返回到其起始位置？ （任何弧都可以多次遍历。）
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.)
# --hints--
`euler208()`应该返回331951449665644800。
`euler208()` should return 331951449665644800.
```js
assert.strictEqual(euler208(), 331951449665644800);