freeCodeCamp

983 B

Raw Blame History

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

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);

Challenge Seed

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

euler458();

Solution

// solution required

983 B Raw Blame History