freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.chinese.md at 3b65bc8191721b3a7259d2daee4bd76e200af5aa

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

942 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3e21000cf542c50fef5	5	Problem 118: Pandigital prime sets		问题118：Pandigital prime set

Description

使用所有数字1到9并自由地连接它们以形成十进制整数，可以形成不同的集合。有趣的是，集合{2,5,47,89,631}，属于它的所有元素都是素数。包含每个数字1到9的多少个不同的集合只包含主要元素？

Instructions

Tests

tests:
  - text: <code>euler118()</code>应返回44680。
    testString: assert.strictEqual(euler118(), 44680);

Challenge Seed

function euler118() {
  // Good luck!
  return true;
}

euler118();

Solution

// solution required

942 B Raw Blame History Unescape Escape