70 lines
1.4 KiB
Markdown
70 lines
1.4 KiB
Markdown
---
|
|
id: 5900f42b1000cf542c50ff3e
|
|
challengeType: 5
|
|
title: 'Problem 191: Prize Strings'
|
|
forumTopicId: 301829
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
A particular school offers cash rewards to children with good attendance and punctuality. If they are absent for three consecutive days or late on more than one occasion then they forfeit their prize.
|
|
|
|
During an n-day period a trinary string is formed for each child consisting of L's (late), O's (on time), and A's (absent).
|
|
|
|
Although there are eighty-one trinary strings for a 4-day period that can be formed, exactly forty-three strings would lead to a prize:
|
|
|
|
OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA
|
|
OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO
|
|
AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL
|
|
AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA
|
|
LAOO LAOA LAAO
|
|
|
|
How many "prize" strings exist over a 30-day period?
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler191()</code> should return 1918080160.
|
|
testString: assert.strictEqual(euler191(), 1918080160);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler191() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler191();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|