61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
57 lines
1.1 KiB
Markdown
57 lines
1.1 KiB
Markdown
---
|
||
id: 5900f5311000cf542c510044
|
||
challengeType: 5
|
||
title: 'Problem 453: Lattice Quadrilaterals'
|
||
videoUrl: ''
|
||
localeTitle: 问题453：格子四边形
|
||
---
|
||
|
||
## Description
|
||
<section id="description">简单的四边形是具有四个不同顶点的多边形，没有直角并且不会自相交。 <p>设Q（m，n）为简单四边形的数量，其顶点为格点，坐标（x，y）满足0≤x≤m且0≤y≤n。 </p><p>例如，Q（2,2）= 94，如下所示： </p><p>还可以证实Q（3,7）= 39590，Q（12,3）= 309000和Q（123,45）= 70542215894646。 </p><p>找到Q（12345,6789）mod 135707531。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler453()</code>应该返回104354107。
|
||
testString: assert.strictEqual(euler453(), 104354107);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler453() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler453();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|