freeCodeCamp/problem-49-prime-permutations.chinese.md at 5e56a9a93860c488ae979ce58f870e75a67d1c15

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.1 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f39d1000cf542c50feb0	5	Problem 49: Prime permutations		问题49：主要排列

Description

算术序列1487,4817,8147，其中每个项增加3330，在两个方面是不寻常的：（i）三个项中的每一个都是素数，并且，（ii）每个4位数字是彼此的排列。没有由三个1位，2位或3位数的素数组成的算术序列，表现出这种性质，但还有另外一个4位数的增加序列。你通过连接这个序列中的三个术语来形成12位数字？

Instructions

Tests

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

Challenge Seed

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

primePermutations();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape