56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f5081000cf542c51001a
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 412: Gnomon numbering'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题412：Gnomon编号
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">对于整数m，n（0≤n<m），令L（m，n）为m×m网格，其中右上n×n网格被移除。 <p>例如，L（5,3）看起来像这样： </p><p>我们希望用连续的整数1,2,3 ......对L（m，n）的每个单元进行编号，使得每个单元格中的数字小于它下面和左边的数字。 </p><p>例如，这里有两个有效的L（5,3）编号： </p><p>设LC（m，n）为L（m，n）的有效编号。可以证实LC（3,0）= 42，LC（5,3）= 250250，LC（6,3）= 406029023400和LC（10,5）mod 76543217 = 61251715。 </p><p>找到LC（10000,5000）mod 76543217。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler412()</code>应该返回38788800。
|
|||
|
|
testString: 'assert.strictEqual(euler412(), 38788800, "<code>euler412()</code> should return 38788800.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler412() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler412();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|