freeCodeCamp/problem-458-permutations-of-project.english.md at 0a330e65f902dcbf750d0f0666c737dd9335f76d

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1013 B

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f5361000cf542c510049	5	Problem 458: Permutations of Project

Description

Consider the alphabet A made out of the letters of the word "project": A={c,e,j,o,p,r,t}. Let T(n) be the number of strings of length n consisting of letters from A that do not have a substring that is one of the 5040 permutations of "project".

T(7)=77-7!=818503.

Find T(1012). Give the last 9 digits of your answer.

Instructions

Tests

tests:
  - text: <code>euler458()</code> should return 423341841.
    testString: assert.strictEqual(euler458(), 423341841, '<code>euler458()</code> should return 423341841.');

Challenge Seed

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

euler458();

Solution

// solution required

1013 B Raw Blame History