freeCodeCamp/problem-35-circular-primes.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.5 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f38f1000cf542c50fea2	5	Problem 35: Circular primes		问题35：循环素数

Description

这个数字197被称为循环素数，因为数字的所有旋转：197,971和719本身都是素数。在100：2,3,5,7,11,13,17,31,37,71,73,79和97之下有十三个这样的素数。在n下面有多少个圆形素数，而100 <= n < = 1000000？

Instructions

Tests

tests:
  - text: <code>circularPrimes(100)</code>应该返回13。
    testString: assert(circularPrimes(100) == 13);
  - text: <code>circularPrimes(100000)</code>应该返回43。
    testString: assert(circularPrimes(100000) == 43);
  - text: <code>circularPrimes(250000)</code>应该返回45。
    testString: assert(circularPrimes(250000) == 45);
  - text: <code>circularPrimes(500000)</code>应该返回49。
    testString: assert(circularPrimes(500000) == 49);
  - text: <code>circularPrimes(750000)</code>应该返回49。
    testString: assert(circularPrimes(750000) == 49);
  - text: <code>circularPrimes(1000000)</code>应该返回55。
    testString: assert(circularPrimes(1000000) == 55);

Challenge Seed

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

circularPrimes(1000000);

Solution

// solution required

1.5 KiB Raw Blame History Unescape Escape