1.8 KiB
1.8 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f38f1000cf542c50fea2 | 5 | Problem 35: Circular primes | 问题35:循环素数 |
Description
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