32fac23a2d
* fix: clean-up Project Euler 161-180 * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
52 lines
873 B
Markdown
52 lines
873 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
|
|
|
|
$$\begin{array}{}
|
|
6 & 3 & 3 & 0 \\\\
|
|
5 & 0 & 4 & 3 \\\\
|
|
0 & 7 & 1 & 4 \\\\
|
|
1 & 2 & 4 & 5
|
|
\end{array}$$
|
|
|
|
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--
|
|
|
|
`crissCross()` should return `7130034`.
|
|
|
|
```js
|
|
assert.strictEqual(crissCross(), 7130034);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function crissCross() {
|
|
|
|
return true;
|
|
}
|
|
|
|
crissCross();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|