Oliver Eyton-Williams ee1e8abd87

feat(curriculum): restore seed + solution to Chinese (#40683 )

* 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>

2021-01-12 19:31:00 -07:00

1.1 KiB

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f3911000cf542c50fea4	问题37：可截断的素数	5		problem-37-truncatable-primes

--description--

3797号有一个有趣的财产。作为素数本身，可以从左到右连续删除数字，并在每个阶段保持素数：3797,797,97和7.同样，我们可以从右到左工作：3797,379,37和3。找到从左到右和从右到左都可截断的唯一n（8 <= n <= 11）个素数之和。注意：2,3,5和7不被认为是可截断的素数。

--hints--

truncatablePrimes(8)应该返回1986年。

assert(truncatablePrimes(8) == 1986);

truncatablePrimes(9)应该返回5123。

assert(truncatablePrimes(9) == 5123);

truncatablePrimes(10)应该返回8920。

assert(truncatablePrimes(10) == 8920);

truncatablePrimes(11)应该返回748317。

assert(truncatablePrimes(11) == 748317);

--seed--

--seed-contents--

function truncatablePrimes(n) {

  return n;
}

truncatablePrimes(11);

--solutions--

// solution required

1.1 KiB Raw Blame History Unescape Escape