freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-428-necklace-of-cir...

70 lines
2.2 KiB
Markdown
Raw Normal View History

---
id: 5900f5191000cf542c51002b
challengeType: 5
videoUrl: ''
localeTitle: 问题428圆圈项链
---
## Description
<section id="description">
<var> a </var><var> b </var><var> c </var>为正数。
令WXYZ为四个共线点其中| WX | = <var></var>| XY | = <var> b </var>| YZ | = <var> c </var>和| WZ | = <var> a </var> + <var> b </var> + <var> c </var>
</sub>中的C <sub>为直径XY的圆。
令C <sub> out </sub>为直径WZ的圆。
如果可以放置<var> k则三元组<var> a </var><var> b </var><var> c </var>)被称为<em>项链三元组</ em></var>≥3个不同的圆C <sub> 1 </sub>C <sub> 2 </sub>...C <sub> <var> k </var> </sub>
<ul> <li> C <sub> <var> i </var> </sub>与任何C <sub> <var> j </var> </sub>都没有公共内点且1≤<var > i </var><var> j </var><var> k </var><var> i </var><var> j </var></ li> <li> C <sub> <var> i </var> </sub></sub>中的C <sub>和 C <sub> out </sub>表示1≤<var> i </var><var> k </var></ li> <li> C <sub> <var> i </var> < / sub>与C <sub> <var> i </var> +1 </sub>相切1≤<var> i </var> &lt; <var> k </var></ li> <li> C <sub> <var> k </var> </sub>与C <sub> 1 </sub>相切。</ li> </ ul>
例如5,5,54,3,21是项链三胞胎而可以证明2,2,5不是。
<img src="https://projecteuler.net/project/images/p428_necklace.png" alt="a visual representation of a necklace triplet">
令T<var> n </var>)为项链三联体的数量(<var> a </var><var> b </var><var> c </var>),使得<var > a </var><var> b </var><var> c </var>是正整数,并且<var> b </var><var> n </var>
例如T1= 9T20= 732和T3000= 438106。
求T1000000000000
</section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>necklace(1000000000)</code>应该返回747215561862。
testString: assert.strictEqual(necklace(1000000000), 747215561862);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function necklace(n) {
// Good luck!
return true;
}
necklace(1000000000)
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>