+ 3
Fibonacci
fibonacci series, Do it!
12 Antworten
+ 8
https://code.sololearn.com/cxpVnO0J3v5H/?ref=app
https://code.sololearn.com/cdHtKmzNp90d/?ref=app
https://code.sololearn.com/cwP1CFByN744/?ref=app
https://code.sololearn.com/cY36LCI0H61o/?ref=app
https://code.sololearn.com/wJ152Hne9u9D/?ref=app
https://code.sololearn.com/c995EIHQ3ixv/?ref=app
https://code.sololearn.com/WfZq7LiP5L86/?ref=app
+ 8
one is a simple Fibonacci. the other was a project Euler challenge to get to total sum of all even numbers on the Fibonacci below 4 million
https://code.sololearn.com/c9e526aU2uaB/?ref=app
https://code.sololearn.com/cUcZyEcnRtMw/?ref=app
+ 6
Here is my attempt! :)
https://code.sololearn.com/ci0O8pXP6Ai9/?ref=app
+ 6
input any 2 integers (positive and negative, even 1 zero), this code will generate new Fibonacci sequence from those numbers until the golden ratio is achieved
https://code.sololearn.com/ciC3g6n9tbK1/?ref=app
+ 5
https://code.sololearn.com/cm8C9cn7lRKr/?ref=app
+ 3
My try in java
https://code.sololearn.com/cDKQTRr81Qvm/?ref=app
+ 3
fibonacci series code in c language https://code.sololearn.com/cD68W7UVKiJD/?ref=app
0
https://code.sololearn.com/cFSrGw3QKTa1/?ref=app
0
num = int(input())
def f(n):
#complete the recursive function
u=0
v=1
print(0)
print(1)
for i in range(2,n):
c=u+v
u=v
v=c
print(v)
f(num)
0
num = int(input())
def fibonacci(n):
#complete the recursive function
if n<=1:
return n
else:
return fibonacci(n-1) + fibonacci(n-2)
for i in range(num):
print(fibonacci(i))