gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Feat: add new Markdown parser (#39800)

Browse Source 
and change all the challenges to new `md` format.
This commit is contained in:
Oliver Eyton-Williams
2020-11-27 19:02:05 +01:00
committed by GitHub
parent a07f84c8ec
commit 0bd52f8bd1
2580 changed files with 113436 additions and 111979 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
View File

@ -1,48 +1,33 @@
---
id: 5900f4131000cf542c50ff25
challengeType: 5
title: 'Problem 166: Criss Cross'
challengeType: 5
forumTopicId: 301800
---
## Description
<section id='description'>
# --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
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?
</section>
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler166()</code> should return 7130034.
testString: assert.strictEqual(euler166(), 7130034);
`euler166()` should return 7130034.
```js
assert.strictEqual(euler166(), 7130034);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler166() {
@ -53,17 +38,8 @@ function euler166() {
euler166();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>