freeCodeCamp/problem-41-pandigital-prime.chinese.md at 3ee1c39e41c1aae3b0b23b3e79fba3ec1aae1989

Files

Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220 )

* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions

2020-03-03 18:49:47 +05:30

1.0 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3951000cf542c50fea8	5	Problem 41: Pandigital prime		问题41：Pandigital prime

Description

我们将说n数字是pandigital，如果它使用所有数字1到n恰好一次。例如，2143是一个4位数的pandigital，也是素数。什么是最大的n长数字pandigital素数？

Instructions

Tests

tests:
  - text: <code>pandigitalPrime(4)</code>应该返回4231。
    testString: assert(pandigitalPrime(4) == 4231);
  - text: <code>pandigitalPrime(7)</code>应该返回7652413。
    testString: assert(pandigitalPrime(7) == 7652413);

Challenge Seed

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

pandigitalPrime(7);

Solution

// solution required

1.0 KiB Raw Blame History Unescape Escape