--

Python

Python 5

Python 7

Python 6

[Python 100] Python 100

Fibonacci sequence0112358132134

F0 = 0     (n=0)
F1 = 1    (n=1)
Fn = F[n-1]+ F[n-2](n=>2)

#!/usr/bin/python # -*- coding: UTF-8 -*- def fib(n): a,b = 1,1 for i in range(n-1): a,b = b,a+b return a # 10 print (fib(10))

#!/usr/bin/python # -*- coding: UTF-8 -*- # def fib(n): if n==1 or n==2: return 1 return fib(n-1)+fib(n-2) # 10 print (fib(10))

#!/usr/bin/python # -*- coding: UTF-8 -*- def fib(n): if n == 1: return [1] if n == 2: return [1, 1] fibs = [1, 1] for i in range(2, n): fibs.append(fibs[-1] + fibs[-2]) return fibs # 10 print (fib(10))

[1, 1, 2, 3, 5, 8, 13, 21, 34, 55]

[Python 100] Python 100

AI ...

Python 5

Python 7

9

#!/usr/bin/env python
#coding:utf-8

# n

n = int(raw_input(" "))

# 
f =(1/(5**0.5))*(((1+(5**0.5))/2)**n - ((1-(5**0.5))/2)**n)
print "%d"%n,int(f)

# n
l=[1]
for i in range(1,n+1):
    f=(1/(5**0.5))*(((1+(5**0.5))/2)**i - ((1-(5**0.5))/2)**i)
    l.append(int(f))

10 (2017-04-14)

#!/usr/bin/python
# -*- coding: UTF-8 -*-

def Fib(n):
    a, b = 0, 1
    while n:
        a, b, n = b, a + b, n - 1
        print(a)
Fib(7)

9 (2017-04-25)

#!/usr/bin/env python
#coding:utf-8

#---
def fib(max):
    n,a,b = 0,0,1
    while n < max:
        yield b
        a,b = b,a+b
        n += 1
max = int(input('input max num :'))
for n in fib(max):
    print(n)

dawn9 (2017-05-05)

#!/usr/bin/env python
#coding:utf-8

list = []
a = 1
list.append(a)    # 
b = 1
list.append(b)    # 
for i in range(1,20):  #  19 
    c = list[i-1]+list[i]
    list.append(c)
print list   #  21

lqy1269 (2017-05-05)

#!/usr/bin/python3

from functools import lru_cache

@lru_cache(None)
def f(n):
    assert n >= 0
    return n if n <= 1 else f(n - 1) + f(n - 2)


print(f(10))

Chyroc9 (2017-05-31)

Python3

#!/usr/bin/env python3
# -*- coding:utf-8 -*-

class Fibs:
    def __init__(self, n = 10):
        self.a = 0
        self.b = 1
        self.n = n
        self.i = 0
    def __iter__(self):
        return self
    def __next__(self):
        self.a, self.b = self.b, self.a+self.b
        self.i += 1
        if self.i > self.n:
            raise StopIteration
        return self.a
fibs=Fibs(10)
for i in fibs:
    print (i)

makeWorks9 (2017-08-23)

#!/usr/bin/python
# -*- coding: UTF-8 -*-

l=[0,1]
for i in range(10):
    l.append(reduce (lambda x,y:x+y,l[-1:-3:-1]))
print l

abc9 (2017-08-28)

# -*- coding: UTF-8 -*-

fe_list = [0, 1]
for i in range(1,11):
    fe_list.append(sum(fe_list[(i-1):(i+1)]))

print fe_list

boy9 (2017-10-19)

n = int(input("> "))
f = [0, 1]
print([f[i] for i in range(2, n + 1) if not f.append(f[i - 1] + f[i - 2])][-1])

mayi8 (2018-12-22)

: ·HTML; ·CSS; ·JavaScript; ·Ajax; ·jQuery; ·XML; ·Java

&: · HTML; · HTML ASCII; · JS /; · PNG/JPEG; · HTML; · JSON; ·

: · Ollama ...; · Ollama ...; · Ollama; · Ollama ...; · Ollama ...; · Ollama AI ...; · Ollama RAG...

: ·; ·; ·; ·; ·

Web Proxy Viewer | New URL | Original Page