2021-06-15 00:49:18 -07:00
---
id: 5900f3c11000cf542c50fed4
2022-02-19 20:11:19 +05:30
title: 'Problema 85: contando rettangoli'
2021-06-15 00:49:18 -07:00
challengeType: 5
forumTopicId: 302199
dashedName: problem-85-counting-rectangles
---
# --description--
2022-02-19 20:11:19 +05:30
Contando con attenzione si può vedere che una griglia rettangolare che misuraa 3 per 2 contiene 18 rettangoli:
2021-06-15 00:49:18 -07:00
2022-02-19 20:11:19 +05:30
< img class = "img-responsive center-block" alt = "un diagramma dei differenti rettangoli trovati dentro una griglia rettangolare 3 per 2" src = "https://cdn-media-1.freecodecamp.org/project-euler/counting-rectangles.png" style = "background-color: white; padding: 10px;" / >
2021-06-15 00:49:18 -07:00
2022-02-19 20:11:19 +05:30
Anche se potrebbe esistere una griglia rettangolare che contiene esattamente `n` rettangoli, trova l'area della griglia con la soluzione più vicina.
2021-06-15 00:49:18 -07:00
# --hints--
2022-02-19 20:11:19 +05:30
`countingRectangles(18)` dovrebbe restituire un numero.
2021-06-15 00:49:18 -07:00
```js
assert(typeof countingRectangles(18) === 'number');
```
2022-02-19 20:11:19 +05:30
`countingRectangles(18)` dovrebbe restituire `6` .
2021-06-15 00:49:18 -07:00
```js
assert.strictEqual(countingRectangles(18), 6);
```
2022-02-19 20:11:19 +05:30
`countingRectangles(250)` dovrebbe restituire `22` .
2021-06-15 00:49:18 -07:00
```js
assert.strictEqual(countingRectangles(250), 22);
```
2022-02-19 20:11:19 +05:30
`countingRectangles(50000)` dovrebbe restituire `364` .
2021-06-15 00:49:18 -07:00
```js
assert.strictEqual(countingRectangles(50000), 364);
```
2022-02-19 20:11:19 +05:30
`countingRectangles(1000000)` dovrebbe restituire `1632` .
2021-06-15 00:49:18 -07:00
```js
assert.strictEqual(countingRectangles(1000000), 1632);
```
2022-02-19 20:11:19 +05:30
`countingRectangles(2000000)` dovrebbe restituire `2772` .
2021-06-15 00:49:18 -07:00
```js
assert.strictEqual(countingRectangles(2000000), 2772);
```
# --seed--
## --seed-contents--
```js
function countingRectangles(n) {
return true;
}
countingRectangles(18);
```
# --solutions--
```js
function countingRectangles(n) {
function numberOfRectangles(h, w) {
return (h * (h + 1) * w * (w + 1)) / 4;
}
function rectangleArea(h, w) {
return h * w;
}
let rectanglesCount = 1;
let maxSide = 1;
while (rectanglesCount < n ) {
maxSide++;
rectanglesCount = numberOfRectangles(maxSide, 1);
}
let bestDiff = Math.abs(rectanglesCount - n);
let bestSize = [maxSide, 1];
let curHeight = maxSide - 1;
let curWidth = 1;
for (curWidth; curWidth < curHeight ; curWidth + + ) {
for (curHeight; curHeight > curWidth; curHeight--) {
rectanglesCount = numberOfRectangles(curHeight, curWidth);
const curDiff = Math.abs(rectanglesCount - n);
if (curDiff < bestDiff ) {
bestDiff = curDiff;
bestSize = [curHeight, curWidth];
}
if (rectanglesCount < n ) {
break;
}
}
}
return rectangleArea(...bestSize);
}
```