56 lines
982 B
Markdown
56 lines
982 B
Markdown
---
|
||
id: 5900f4131000cf542c50ff25
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题166：克里斯十字架
|
||
---
|
||
|
||
## Description
|
||
<section id="description"> 4x4网格填充数字d，0≤d≤9。 <p>可以看出，在网格中</p><p> 6 3 3 0 5 0 4 3 0 7 1 4 1 2 4 5 </p><p>每行和每列的总和值为12.此外，每个对角线的总和也是12。 </p><p>在多少种方法中，您可以使用数字d，0≤d≤9填充4x4网格，以便每行，每列和两个对角线具有相同的总和？ </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler166()</code>应返回7130034。
|
||
testString: assert.strictEqual(euler166(), 7130034);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler166() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler166();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|