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

16
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
View File

@ -1,20 +1,26 @@
---
id: 5900f4ca1000cf542c50ffdc
title: 问题349：兰顿的蚂蚁
title: 'Problem 349: Langton''s ant'
challengeType: 5
videoUrl: ''
forumTopicId: 302008
dashedName: problem-349-langtons-ant
---
# --description--
蚂蚁在规则的方格网格上移动，方格网格为黑色或白色。蚂蚁总是朝向一个主要方向（左，右，上或下），并根据以下规则从正方形移动到相邻正方形： - 如果它在黑色方块上，它将方形的颜色翻转为白色，逆时针旋转90度，向前移动一个方格。 - 如果它在白色方块上，它将方块的颜色翻转为黑色，顺时针旋转90度并向前移动一个方格。
An ant moves on a regular grid of squares that are coloured either black or white.
从一个完全是白色的网格开始，在蚂蚁1018次移动后，有多少个方块是黑色的？
The ant is always oriented in one of the cardinal directions (left, right, up or down) and moves from square to adjacent square according to the following rules:
\- if it is on a black square, it flips the color of the square to white, rotates 90 degrees counterclockwise and moves forward one square.
\- if it is on a white square, it flips the color of the square to black, rotates 90 degrees clockwise and moves forward one square.
Starting with a grid that is entirely white, how many squares are black after 1018 moves of the ant?
# --hints--
`euler349()`应该返回115384615384614940。
`euler349()` should return 115384615384614940.
```js
assert.strictEqual(euler349(), 115384615384614940);