32fac23a2d
* fix: clean-up Project Euler 161-180 * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
1.4 KiB
1.4 KiB
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 5900f41a1000cf542c50ff2c | Problem 173: Using up to one million tiles how many different "hollow" square laminae can be formed? | 5 | 301808 | problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed |
--description--
We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry. For example, using exactly thirty-two square tiles we can form two different square laminae:
With one-hundred tiles, and not necessarily using all of the tiles at one time, it is possible to form forty-one different square laminae. Using up to one million tiles how many different square laminae can be formed?
--hints--
differentHollowSquareLaminae() should return 1572729.
assert.strictEqual(differentHollowSquareLaminae(), 1572729);
--seed--
--seed-contents--
function differentHollowSquareLaminae() {
return true;
}
differentHollowSquareLaminae();
--solutions--
// solution required