chore(i18n,learn): processed translations (#45271)

This commit is contained in:
camperbot
2022-02-28 13:29:21 +05:30
committed by GitHub
parent 5e5015e47d
commit fbc7a26529
127 changed files with 1288 additions and 1079 deletions

View File

@@ -1,6 +1,6 @@
---
id: 5900f4131000cf542c50ff25
title: 'Problem 166: Criss Cross'
title: 'Problema 166: Criss Cross'
challengeType: 5
forumTopicId: 301800
dashedName: problem-166-criss-cross
@@ -8,22 +8,22 @@ dashedName: problem-166-criss-cross
# --description--
A 4x4 grid is filled with digits d, 0 ≤ d ≤ 9.
Una griglia 4x4 è riempita con cifre $d$, $0 ≤ d ≤ 9$.
It can be seen that in the grid
Si può vedere che nella griglia
6 3 3 0 5 0 4 3 0 7 1 4 1 2 4 5
$$\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.
la somma di ciascuna riga e di ciascuna colonna ha il valore 12. Inoltre la somma di ogni diagonale è anch'essa 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?
In quanti modi puoi riempire una griglia 4x4 con le cifre $d$, $0 ≤ d ≤ 9$ in modo che ogni riga, ogni colonna ed entrambe le diagonali abbiano la stessa somma?
# --hints--
`euler166()` should return 7130034.
`crissCross()` dovrebbe restituire `7130034`.
```js
assert.strictEqual(euler166(), 7130034);
assert.strictEqual(crissCross(), 7130034);
```
# --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler166(), 7130034);
## --seed-contents--
```js
function euler166() {
function crissCross() {
return true;
}
euler166();
crissCross();
```
# --solutions--