56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
|
id: 5900f4cb1000cf542c50ffde
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 351: Hexagonal orchards'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题351：六角形果园
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description"> n阶六角形果园是由正六边形中具有边n的点构成的三角形格子。以下是5阶六角形果园的示例： <p>以绿色突出显示的是通过靠近它的点从中心隐藏的点。可以看出，对于5阶六角形果园，中心隐藏了30个点。 </p><p>设H（n）是在n阶六角形果园中从中心隐藏的点数。 </p><p> H（5）= 30.H（10）= 138.H（1 000）= 1177848。 </p><p>找H（100 000 000）。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler351()</code>应该返回11762187201804552。
|
|||
|
|
testString: 'assert.strictEqual(euler351(), 11762187201804552, "<code>euler351()</code> should return 11762187201804552.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler351() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler351();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|