56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f5361000cf542c510049
|
||
challengeType: 5
|
||
title: 'Problem 458: Permutations of Project'
|
||
videoUrl: ''
|
||
localeTitle: 问题458：项目的排列
|
||
---
|
||
|
||
## Description
|
||
<section id="description">考虑由“项目”一词的字母组成的字母A：A = {c，e，j，o，p，r，t}。令T（n）为长度为n的字符串数，该字符串由来自A的字母组成，其中没有子字符串，该子字符串是“项目”的5040个排列之一。 <p> T（7）= 77-7！= 818503。 </p><p>找到T（1012）。给出答案的最后9位数字。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler458()</code>应该返回423341841。
|
||
testString: 'assert.strictEqual(euler458(), 423341841, "<code>euler458()</code> should return 423341841.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler458() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler458();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|