1.6 KiB
1.6 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3911000cf542c50fea4 | 5 | Problem 37: Truncatable primes | 问题37:可截断的素数 |
Description
Instructions
Tests
tests:
- text: <code>truncatablePrimes(8)</code>应该返回1986年。
testString: 'assert(truncatablePrimes(8) == 1986, "<code>truncatablePrimes(8)</code> should return 1986.");'
- text: <code>truncatablePrimes(9)</code>应该返回5123。
testString: 'assert(truncatablePrimes(9) == 5123, "<code>truncatablePrimes(9)</code> should return 5123.");'
- text: <code>truncatablePrimes(10)</code>应该返回8920。
testString: 'assert(truncatablePrimes(10) == 8920, "<code>truncatablePrimes(10)</code> should return 8920.");'
- text: <code>truncatablePrimes(11)</code>应该返回748317。
testString: 'assert(truncatablePrimes(11) == 748317, "<code>truncatablePrimes(11)</code> should return 748317.");'
Challenge Seed
function truncatablePrimes(n) {
// Good luck!
return n;
}
truncatablePrimes(11);
Solution
// solution required