56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f4071000cf542c50ff19
|
||
challengeType: 5
|
||
title: 'Problem 154: Exploring Pascal"s pyramid'
|
||
videoUrl: ''
|
||
localeTitle: ''
|
||
---
|
||
|
||
## Description
|
||
<section id="description">使用球形球构造三角形金字塔,使得每个球恰好位于下一个较低水平的三个球上。 <p>然后,我们计算从顶点到每个位置的路径数量:路径从顶点开始并向下前进到当前位置正下方的三个球体中的任何一个。因此,到达某个位置的路径数是紧接在其上方的数字的总和(取决于位置,在其上方最多有三个数字)。结果是Pascal的金字塔,每个级别n的数字是三项式展开(x + y + z)n的系数。 (x + y + z)200000的扩展中有多少个系数是1012的倍数? </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler154()</code>应该返回479742450。
|
||
testString: 'assert.strictEqual(euler154(), 479742450, "<code>euler154()</code> should return 479742450.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler154() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler154();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|