chore(i8n,learn): processed translations

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

View File

@ -1,24 +1,24 @@
---
id: 5900f4891000cf542c50ff9b
title: 问题284平稳正方形
title: 'Problem 284: Steady Squares'
challengeType: 5
videoUrl: ''
forumTopicId: 301935
dashedName: problem-284-steady-squares
---
# --description--
十进制编号系统中的3位数字376是具有特殊属性的数字的示例该属性的平方以相同的数字结尾3762 =141376。让我们将具有此属性的数字称为稳定平方。
The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: 3762 = 141376. Let's call a number with this property a steady square.
在其他编号系统中也可以看到稳定的正方形。 在基数14的编号系统中三位数c37也是一个稳定的正方形c372 = aa0c37并且在同一编号系统中其位数之和为c + 3 + 7 = 18。 字母abc和d以类似于十六进制编号系统的方式分别用于10、11、12和13位数字。
Steady squares can also be observed in other numbering systems. In the base 14 numbering system, the 3-digit number c37 is also a steady square: c372 = aa0c37, and the sum of its digits is c+3+7=18 in the same numbering system. The letters a, b, c and d are used for the 10, 11, 12 and 13 digits respectively, in a manner similar to the hexadecimal numbering system.
对于1≤n≤9在基数14的编号系统中所有n位稳定正方形的位总和为2d8十进制582。 不允许以0开头的稳定正方形。
For 1 ≤ n ≤ 9, the sum of the digits of all the n-digit steady squares in the base 14 numbering system is 2d8 (582 decimal). Steady squares with leading 0's are not allowed.
在基数为14的编号系统中找到所有n位稳定正方形的位总和 1≤n≤10000十进制并在基数为14的系统中根据需要使用小写字母给出答案。
Find the sum of the digits of all the n-digit steady squares in the base 14 numbering system for 1 ≤ n ≤ 10000 (decimal) and give your answer in the base 14 system using lower case letters where necessary.
# --hints--
`euler284()`应该返回5a411d7b
`euler284()` should return 5a411d7b.
```js
assert.strictEqual(euler284(), '5a411d7b');