Input should not be provided as a sequence when it is of fixed size.

Lua translation !

JavaScript: Reference solution and example solution are unreasonably golfed and should be changed to some more maintainable form. I would do it myself, but I cannot make heads and tails of this mess. Halp!

How exactly are the spells produced? I could figure out how to derive modifier and maximum spell level!

I have found the math formula for this problem and tested in local.Though I reduced the time complexity to O(n), It still show time out (12000 ms).It's a bit annoying。

Lua Fork

• Added math.randomseed(os.time()) to generate different random tests each time we run them
• Added a tester function displaying parameters to the user
• Added the name xbonacci to the function to match description and display of inputs
• Put Sample Tests in its so they are actually tested
• Refactored Fixed Tests and Sample Tests to increase readability

Haskell fork

• Submission test input range expanded to make $O(n^2)$ solutions fail.

The C# reference solution returns different results compared to other languages.

level = 11, score = 32
Test Failed
  Expected: 161
  But was:  166

Possible Java translation

Fixed description merge problems of Clojure Translation by a deleted user.

Python new test framework required.

Haskell translation

Description should be language-agnostic

C, C++, Objective-C, possibly NASM: random tests generate 63-bit numbers which can be very unfavorable and result in unsolvable inputs, and, as a result, timeouts (they can't be handled even by reference solution). Upper bounds of inputs should be either unified between languages, or inputs sohuld be guaranteed to be solvable.