[TPC-R] #1 Fibonacci

for x in-2,2:print" 3 1 9R7u3l1e9z7"[::x]

from math import *
def fib(n):
	if n <= 70:
		return floor((((1 + sqrt(5))/2)**n)/sqrt(5) + 0.5)
	else:
		return fib(n-1) + fib(n-2)

def funcion():
    print([fib(i) for i in range(101)])
funcion() 

print int((((1 + 5**0.5) / 2)**100 - (1-((1 + 5**0.5) / 2))**100) / 5**0.5)

# Juan 

my $n0 = 0;
my $n1 = 1;

print "$n0\n$n1\n";

for my $numero (0..100)
{
    my $resultado = $n0 + $n1;
	
	print "$resultado\n";
	
	$n0 = $n1;
	$n1 = $resultado;
}

def f():g=lambda n:1if(n<2)else(g(n-1)+g(n-2));return[g(i)for i in range(100)]

def a():
 b = [1,1]
 for x in range(98): b.append(b[-1]+b[-2])
 return b

def f():l=[1,1];exec"l.append(l[-1]+l[-2]);"*98;return l

def f():l=[1,1];exec"l.append(l[-1]+l[-2]);"*98;return l

def f():l=[1,1];exec"l+=[l[-1]+l[-2]];"*98;return l

def fib_aux(x,y,n):
	return x if n==0 else fib_aux(y,x+y,n-1)
def fib(n):
	return 1 if n<2 else fib_aux(1,1,n-1)
print [fib(i) for i in range(0,100)]

#!/usr/bin/env python

import time


def fib_aux(x,y,n):
        return x if n==0 else fib_aux(y,x+y,n-1)
def fib(n):
        return 1 if n<2 else fib_aux(1,1,n-1)

def a():
    b = [1,1]
    for x in range(700): b.append(b[-1]+b[-2])
    return b
    
ttot = 0
for i in range(0,1000):
	it = time.time()
	fib(700)
	et = time.time()
	ttot += et-it
print ttot/1000

ttot = 0
for i in range(0,1000):
	it = time.time()
	a()
	et = time.time()
	ttot += et-it
print ttot/1000

import time


def fib_aux(x,y,n):
        return x if n==0 else fib_aux(y,x+y,n-1)
def fib(n):
        return 1 if n<2 else fib_aux(1,1,n-1)

def a():
    b = [1,1]
    for x in range(100): b.append(b[-1]+b[-2])
    return b
    
ttot = 0
for i in range(0,10000):
	it = time.time()
	t = [fib(n) for n in range(0,100)]
	et = time.time()
	ttot += et-it
print ttot/10000

ttot = 0
for i in range(0,10000):
	it = time.time()
	t = a()
	et = time.time()
	ttot += et-it
print ttot/10000