58 lines
980 B
Markdown
58 lines
980 B
Markdown
---
|
||
id: 5900f3951000cf542c50fea8
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题41：Pandigital prime
|
||
---
|
||
|
||
## Description
|
||
<section id="description">我们将说<i>n</i>数字是pandigital，如果它使用所有数字1到<i>n</i>恰好一次。例如，2143是一个4位数的pandigital，也是素数。什么是最大的<i>n长</i>数字pandigital素数？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>pandigitalPrime(4)</code>应该返回4231。
|
||
testString: assert(pandigitalPrime(4) == 4231);
|
||
- text: <code>pandigitalPrime(7)</code>应该返回7652413。
|
||
testString: assert(pandigitalPrime(7) == 7652413);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function pandigitalPrime(n) {
|
||
// Good luck!
|
||
return n;
|
||
}
|
||
|
||
pandigitalPrime(7);
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|