freeCodeCamp/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.english.md at 22afc2a0ca354a1eb11919c51058918d7e953e22

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.2 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f41a1000cf542c50ff2c	5	false	Problem 173: Using up to one million tiles how many different "hollow" square laminae can be formed?	301808

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?

Instructions

Tests

tests:
  - text: <code>euler173()</code> should return 1572729.
    testString: assert.strictEqual(euler173(), 1572729);

Challenge Seed

function euler173() {
  // Good luck!
  return true;
}

euler173();

Solution

// solution required

1.2 KiB Raw Blame History