freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-35-circular-primes.chinese.md

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, "<code>circularPrimes(100)</code> should return 13.");'
  - text: <code>circularPrimes(100000)</code>应该返回43。
    testString: 'assert(circularPrimes(100000) == 43, "<code>circularPrimes(100000)</code> should return 43.");'
  - text: <code>circularPrimes(250000)</code>应该返回45。
    testString: 'assert(circularPrimes(250000) == 45, "<code>circularPrimes(250000)</code> should return 45.");'
  - text: <code>circularPrimes(500000)</code>应该返回49。
    testString: 'assert(circularPrimes(500000) == 49, "<code>circularPrimes(500000)</code> should return 49.");'
  - text: <code>circularPrimes(750000)</code>应该返回49。
    testString: 'assert(circularPrimes(750000) == 49, "<code>circularPrimes(750000)</code> should return 49.");'
  - text: <code>circularPrimes(1000000)</code>应该返回55。
    testString: 'assert(circularPrimes(1000000) == 55, "<code>circularPrimes(1000000)</code> should return 55.");'

Challenge Seed

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

circularPrimes(1000000);

Solution

// solution required