ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
47 lines
776 B
Markdown
47 lines
776 B
Markdown
---
|
|
id: 5900f4131000cf542c50ff25
|
|
title: 'Problem 166: Criss Cross'
|
|
challengeType: 5
|
|
forumTopicId: 301800
|
|
dashedName: problem-166-criss-cross
|
|
---
|
|
|
|
# --description--
|
|
|
|
A 4x4 grid is filled with digits d, 0 ≤ d ≤ 9.
|
|
|
|
It can be seen that in the grid
|
|
|
|
6 3 3 0 5 0 4 3 0 7 1 4 1 2 4 5
|
|
|
|
the sum of each row and each column has the value 12. Moreover the sum of each diagonal is also 12.
|
|
|
|
In how many ways can you fill a 4x4 grid with the digits d, 0 ≤ d ≤ 9 so that each row, each column, and both diagonals have the same sum?
|
|
|
|
# --hints--
|
|
|
|
`euler166()` should return 7130034.
|
|
|
|
```js
|
|
assert.strictEqual(euler166(), 7130034);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler166() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler166();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|