1.4 KiB
1.4 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f42b1000cf542c50ff3e | 5 | Problem 191: Prize Strings | 301829 |
Description
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?
Instructions
Tests
tests:
- text: <code>euler191()</code> should return 1918080160.
testString: assert.strictEqual(euler191(), 1918080160);
Challenge Seed
function euler191() {
// Good luck!
return true;
}
euler191();
Solution
// solution required