Cody

Problem 1946. Fibonacci-Sum of Squares

Solution 2279539

Submitted on 14 May 2020 by Luca Fenzi
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
n = 5; S = 40; assert(isequal(FibSumSquares(n),S))

x = 1 1 0 0 0 S = 40
2   Pass
n = 8; S = 714; assert(isequal(FibSumSquares(n),S))

x = 1 1 0 0 0 0 0 0 S = 714
3   Pass
n = 11; S = 12816; assert(isequal(FibSumSquares(n),S))

x = 1 1 0 0 0 0 0 0 0 0 0 S = 12816
4   Pass
n = 15; S = 602070; assert(isequal(FibSumSquares(n),S))

x = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 S = 602070
5   Pass
n = 21; S = 193864606; assert(isequal(FibSumSquares(n),S))

x = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 S = 193864606
6   Pass
n = 26; S = 23843770274; assert(isequal(FibSumSquares(n),S))

x = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 S = 2.3844e+10

Suggested Problems

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!