Files

gikf 32fac23a2d fix(curriculum): clean-up Project Euler 161-180 (#42782 )

* 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>

2021-07-12 16:19:03 +02:00

873 B

Raw Blame History

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f4131000cf542c50ff25	Problem 166: Criss Cross	5	301800	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.

assert.strictEqual(crissCross(), 7130034);

--seed--

--seed-contents--

function crissCross() {

  return true;
}

crissCross();

--solutions--

// solution required

873 B Raw Blame History