56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f4511000cf542c50ff63
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 228: Minkowski Sums'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题228：Minkowski Sums
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">设Sn是常规的n边多边形 - 或形状 - 其顶点<p> vk（k = 1,2，...，n）有坐标： </p><pre> <code>xk = cos( 2k-1/n ×180° ) yk = sin( 2k-1/n ×180° )</code> </pre><p>每个Sn都被解释为由周边和内部的所有点组成的填充形状。 </p><p>两个形状S和T的Minkowski和S + T是结果</p><p>将S中的每个点添加到T中的每个点，其中以坐标方式执行点添加： </p><p> （u，v）+（x，y）=（u + x，v + y）。 </p><p>例如，S3和S4的总和是六边形，如下面粉红色所示： </p><p> S1864 + S1865 + ... + S1909有多少方面？ </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler228()</code>应返回86226。
|
|||
|
|
testString: 'assert.strictEqual(euler228(), 86226, "<code>euler228()</code> should return 86226.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler228() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler228();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|