Problem 1946. Fibonacci-Sum of Squares

Created by Chris Cleveland

Solve Later

Given the Fibonacci sequence defined by the following recursive relation,

F(n) = F(n-1) + F(n-2)
where F(1) = 1 and F(1) = 1

determine the sum of squares for the first "n" terms.

For example, n=5 --> 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.

INPUT n=5
OUTPUT S=40

Solve

Solution Stats

956 Solutions
467 Solvers

Last Solution submitted on Jun 03, 2020

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

goc3 on 23 May 2017

Additional test cases have been added.

Yingcong Zhou on 24 Dec 2017

There is a typo in the question. F_0 = 0 should be F_0 = 1 otherwise the tests will not be passed.

Solution Comments

Solution 1395916

2 Comments

2 Comments

Dishant Varshney on 27 Dec 2017

My solution has much higher size. Someone pls suggest edit. thanks

David Verrelli on 27 Apr 2018

Hello, Dishant Varshney. Your solution is quite legitimate, and that is more important than having a small size! Some comments: 〔1〕 Your code "i = 1: length(f)" and then "f(i)" can be simplified to just "f". You do not need to provide index ranges if you want to refer to _all_ elements of an array or vector. 〔2〕 I would guess that some of the very small submissions have 'cheated' (e.g. by hard-coding solutions in a lookup table), because this Test Suite does not check for any such 'cheats'. 〔3〕 Your solution would fail for n=1, but that is also not checked in this Test Suite. Regards, DIV

Problem Recent Solvers467

Problem Tags

fibonacci sum of squares