2018-10-10 18:03:03 -04:00
|
|
|
|
---
|
|
|
|
|
|
id: 5900f4801000cf542c50ff92
|
|
|
|
|
|
challengeType: 5
|
|
|
|
|
|
videoUrl: ''
|
2020-10-01 17:54:21 +02:00
|
|
|
|
title: 问题275：平衡雕塑
|
2018-10-10 18:03:03 -04:00
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
|
|
## Description
|
|
|
|
|
|
<section id="description">让我们如下定义n阶平衡雕塑：由n + 1个瓷砖组成的多边形，称为块（n个瓷砖）和底座（剩余瓷砖）;底座的中心位置（x = 0，y = 0）;块的y坐标大于零（所以底座是唯一的最低瓦片）;组合的所有块的质心具有等于零的x坐标。在对雕塑进行计数时，任何仅仅是关于y轴的反射的布置都不算是不同的。例如，6级平衡雕塑如下图所示;请注意，每对镜像（关于y轴）都算作一个雕塑： <p>有964个平衡雕塑，订单10和360505订单15.有多少平衡雕塑有18个订单？ </p></section>
|
|
|
|
|
|
|
|
|
|
|
|
## Instructions
|
|
|
|
|
|
<section id="instructions">
|
|
|
|
|
|
</section>
|
|
|
|
|
|
|
|
|
|
|
|
## Tests
|
|
|
|
|
|
<section id='tests'>
|
|
|
|
|
|
|
|
|
|
|
|
```yml
|
|
|
|
|
|
tests:
|
|
|
|
|
|
- text: <code>euler275()</code>应返回15030564。
|
2020-02-18 01:40:55 +09:00
|
|
|
|
testString: assert.strictEqual(euler275(), 15030564);
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
|
|
</section>
|
|
|
|
|
|
|
|
|
|
|
|
## Challenge Seed
|
|
|
|
|
|
<section id='challengeSeed'>
|
|
|
|
|
|
|
|
|
|
|
|
<div id='js-seed'>
|
|
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
|
function euler275() {
|
|
|
|
|
|
// Good luck!
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
euler275();
|
|
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
</section>
|
|
|
|
|
|
|
|
|
|
|
|
## Solution
|
|
|
|
|
|
<section id='solution'>
|
|
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
|
// solution required
|
|
|
|
|
|
```
|
2020-08-13 17:24:35 +02:00
|
|
|
|
|
|
|
|
|
|
/section>
|
