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

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

Browse Source
This commit is contained in:
camperbot
2022-03-01 00:52:39 +05:30
committed by GitHub
parent b8667061a1
commit 18e5be9efa
91 changed files with 1112 additions and 888 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
View File

@ -1,6 +1,6 @@
---
id: 5900f43e1000cf542c50ff4f
title: 'Problem 209: Circular Logic'
title: 'Problema 209: Logica Circolare'
challengeType: 5
forumTopicId: 301850
dashedName: problem-209-circular-logic
@ -8,20 +8,34 @@ dashedName: problem-209-circular-logic
# --description--
A k-input binary truth table is a map from k input bits
Una tabella della verità binaria $k$-input è una mappa da un input a $k$ bit (cifre binarie, 0 [false] o 1 [true]) a 1 bit di output. Per esempio, le tabelle binarie della verità a $2$ bit di input per le funzioni logiche $AND$ e $XOR$ sono:
(binary digits, 0 \[false] or 1 \[true]) to 1 output bit. For example, the 2-input binary truth tables for the logical AND and XOR functions are:
| x | y | x AND y |
| - | - | ------- |
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
x y x AND y000010100111x y x XOR y000011101110How many 6-input binary truth tables, τ, satisfy the formula
| x | y | x XOR y |
| - | - | ------- |
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
τ(a, b, c, d, e, f) AND τ(b, c, d, e, f, a XOR (b AND c)) = 0 for all 6-bit inputs (a, b, c, d, e, f)?
Quante tabelle binarie della verità a $6$ bit di input, $τ$, soddisfano la formula
$$τ(a, b, c, d, e, f) \\; AND \\; τ(b, c, d, e, f, a \\; XOR \\; (b \\; AND \\; c)) = 0$$
per tutti gli input a $6$ bit ($a$, $b$, $c$, $d$, $e$, $f$)?
# --hints--
`euler209()` should return 15964587728784.
`circularLogic()` dovrebbe restituire `15964587728784`.
```js
assert.strictEqual(euler209(), 15964587728784);
assert.strictEqual(circularLogic(), 15964587728784);
```
# --seed--
@ -29,12 +43,12 @@ assert.strictEqual(euler209(), 15964587728784);
## --seed-contents--
```js
function euler209() {
function circularLogic() {
return true;
}
euler209();
circularLogic();
```
# --solutions--