freeCodeCamp/problem-475-music-festival.english.md at 22afc2a0ca354a1eb11919c51058918d7e953e22

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.2 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f5481000cf542c51005a	5	false	Problem 475: Music festival	302152

Description

12n musicians participate at a music festival. On the first day, they form 3n quartets and practice all day. It is a disaster. At the end of the day, all musicians decide they will never again agree to play with any member of their quartet. On the second day, they form 4n trios, each musician avoiding his previous quartet partners.

Let f(12n) be the number of ways to organize the trios amongst the 12n musicians. You are given f(12) = 576 and f(24) mod 1 000 000 007 = 509089824.

Find f(600) mod 1 000 000 007.

Instructions

Tests

tests:
  - text: <code>euler475()</code> should return 75780067.
    testString: assert.strictEqual(euler475(), 75780067);

Challenge Seed

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

euler475();

Solution

// solution required

1.2 KiB Raw Blame History