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

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

Browse Source
This commit is contained in:
camperbot
2022-03-01 21:39:26 +05:30
committed by GitHub
parent c6ec2512ad
commit d62fec495b
61 changed files with 752 additions and 606 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
View File

@ -1,6 +1,6 @@
---
id: 5900f4a11000cf542c50ffb4
title: 'Problem 309: Integer Ladders'
title: 'Problema 309: Scale Intere'
challengeType: 5
forumTopicId: 301963
dashedName: problem-309-integer-ladders
@ -8,20 +8,22 @@ dashedName: problem-309-integer-ladders
# --description--
In the classic "Crossing Ladders" problem, we are given the lengths x and y of two ladders resting on the opposite walls of a narrow, level street. We are also given the height h above the street where the two ladders cross and we are asked to find the width of the street (w).
Nel classico problema delle "scale incrociate", ci sono date le lunghezze $x$ e $y$ di due scale che poggiano sulle pareti opposte di una strada stretta e livellata. Ci viene anche data l'altezza $h$ sopra la strada dove le due scale si incrociano e ci viene chiesto di trovare la larghezza della strada ($w$).
Here, we are only concerned with instances where all four variables are positive integers. For example, if x = 70, y = 119 and h = 30, we can calculate that w = 56.
<img class="img-responsive center-block" alt="scale x e y, attraversando all'altezza h, e poggiando su pareti opposte della strada di larghezza w" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-ladders.gif" style="background-color: white; padding: 10px;" />
In fact, for integer values x, y, h and 0 &lt; x &lt; y &lt; 200, there are only five triplets (x,y,h) producing integer solutions for w: (70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175, 40).
Qui ci occupiamo solo di casi in cui tutte e quattro le variabili sono intere positive. Ad esempio, se $x = 70$, $y = 119$ e $h = 30$, possiamo calcolare che $w = 56$.
For integer values x, y, h and 0 &lt; x &lt; y &lt; 1 000 000, how many triplets (x,y,h) produce integer solutions for w?
Infatti, per valori interi $x$, $y$, $h$ e $0 &lt; x &lt; y &lt; 200$, ci sono solo cinque triplette ($x$, $y$, $h$) cje producono soluzioni intere per $w$: (70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) e (119, 175, 40).
Per valori interi $x$, $y$, $h$ e $0 &lt; x &lt; y &lt; 1\\,000\\,000$, quante triplette ($x$, $y$, $h$) producono soluzioni intere per $w$?
# --hints--
`euler309()` should return 210139.
`integerLadders()` dovrebbe restituire `210139`.
```js
assert.strictEqual(euler309(), 210139);
assert.strictEqual(integerLadders(), 210139);
```
# --seed--
@ -29,12 +31,12 @@ assert.strictEqual(euler309(), 210139);
## --seed-contents--
```js
function euler309() {
function integerLadders() {
return true;
}
euler309();
integerLadders();
```
# --solutions--