2018-10-10 22:03:03 +00:00
---
id: 5900f4481000cf542c50ff5a
2021-02-06 04:42:36 +00:00
title: 'Problem 219: Skew-cost coding'
2018-10-10 22:03:03 +00:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 301861
2021-01-13 02:31:00 +00:00
dashedName: problem-219-skew-cost-coding
2018-10-10 22:03:03 +00:00
---
2020-12-16 07:37:30 +00:00
# --description--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Let A and B be bit strings (sequences of 0's and 1's).
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
If A is equal to the leftmost length(A) bits of B, then A is said to be a prefix of B.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
For example, 00110 is a prefix of 001101001, but not of 00111 or 100110.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
A prefix-free code of size n is a collection of n distinct bit strings such that no string is a prefix of any other. For example, this is a prefix-free code of size 6:
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
0000, 0001, 001, 01, 10, 11
Now suppose that it costs one penny to transmit a '0' bit, but four pence to transmit a '1'. Then the total cost of the prefix-free code shown above is 35 pence, which happens to be the cheapest possible for the skewed pricing scheme in question. In short, we write Cost(6) = 35.
What is Cost(109) ?
2018-10-10 22:03:03 +00:00
2020-12-16 07:37:30 +00:00
# --hints--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
`euler219()` should return 64564225042.
2018-10-10 22:03:03 +00:00
```js
2020-12-16 07:37:30 +00:00
assert.strictEqual(euler219(), 64564225042);
2018-10-10 22:03:03 +00:00
```
2021-01-13 02:31:00 +00:00
# --seed--
## --seed-contents--
```js
function euler219() {
return true;
}
euler219();
```
2020-12-16 07:37:30 +00:00
# --solutions--
2020-08-13 15:24:35 +00:00
2021-01-13 02:31:00 +00:00
```js
// solution required
```