freeCodeCamp/problem-37-truncatable-primes.chinese.md at ff8db8ce9e8413f490626e1572e7fd09825db39c

Files

Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

2020-08-16 04:45:20 +05:30

1.4 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3911000cf542c50fea4	5	Problem 37: Truncatable primes		问题37：可截断的素数

Description

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

Instructions

Tests

tests:
  - text: <code>truncatablePrimes(8)</code>应该返回1986年。
    testString: assert(truncatablePrimes(8) == 1986);
  - text: <code>truncatablePrimes(9)</code>应该返回5123。
    testString: assert(truncatablePrimes(9) == 5123);
  - text: <code>truncatablePrimes(10)</code>应该返回8920。
    testString: assert(truncatablePrimes(10) == 8920);
  - text: <code>truncatablePrimes(11)</code>应该返回748317。
    testString: assert(truncatablePrimes(11) == 748317);

Challenge Seed

function truncatablePrimes(n) {
  // Good luck!
  return n;
}

truncatablePrimes(11);

Solution

// solution required

/section>

1.4 KiB Raw Blame History Unescape Escape