1.9 KiB
1.9 KiB
id | challengeType | title |
---|---|---|
5900f48b1000cf542c50ff9e | 5 | Problem 287: Quadtree encoding (a simple compression algorithm) |
Description
This image can be described by several sequences, for example : "001010101001011111011010101010", of length 30, or "0100101111101110", of length 16, which is the minimal sequence for this image.
For a positive integer N, define DN as the 2N×2N image with the following coloring scheme: the pixel with coordinates x = 0, y = 0 corresponds to the bottom left pixel, if (x - 2N-1)2 + (y - 2N-1)2 ≤ 22N-2 then the pixel is black, otherwise the pixel is white.What is the length of the minimal sequence describing D24 ?
Instructions
Tests
tests:
- text: <code>euler287()</code> should return 313135496.
testString: assert.strictEqual(euler287(), 313135496, '<code>euler287()</code> should return 313135496.');
Challenge Seed
function euler287() {
// Good luck!
return true;
}
euler287();
Solution
// solution required