SlideShare une entreprise Scribd logo
1  sur  165
Télécharger pour lire hors ligne
highlight themes
Angie “@webchick” Byron
September 2016
Brought to you by late-night yak shaving ;)
What’s this then?
• The highlight utility is oft-recommended as a
way to add syntax-highlighted code to Keynote
• It comes with numerous themes/styles
(highlight -w)
• Need for good contrast theme for presentations
• However, the website only has a few samples
How to use
• This presentation demonstrates all themes, against
both dark + light backgrounds
• brew install highlight
• highlight --style=XXX -O rtf file.ext
• Example:
• highlight --syntax=php5 --font-size=30
--style=autumn -O rtf index.php | pbcopy
acid
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
acid
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
aiseered
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
aiseered
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
andes
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
andes
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
anotherdark
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
anotherdark
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
autumn
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
autumn
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
baycomb
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
baycomb
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
bclear
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
bclear
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
biogoo
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
biogoo
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
bipolar
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
bipolar
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
blacknblue
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
blacknblue
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
bluegreen
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
bluegreen
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
breeze
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
breeze
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
bright
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
bright
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
candy
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
candy
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
clarity
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
clarity
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
dante
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
dante
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkblue
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkblue
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkbone
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkbone
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkness
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkness
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkslategray
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkslategray
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkspectrum
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
darkspectrum
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
denim
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
denim
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
dusk
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
dusk
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
earendel
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
earendel
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
easter
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
easter
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-anjuta
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-anjuta
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-eclipse
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-eclipse
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-emacs
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-emacs
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-flashdevelop
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-flashdevelop
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-gedit
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-gedit
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-jedit
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-jedit
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-kwrite
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-kwrite
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-matlab
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-matlab
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-msvs2008
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-msvs2008
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-nedit
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-nedit
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-vim-dark
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-vim-dark
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-vim
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-vim
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-xcode
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
edit-xcode
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
ekvoli
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
ekvoli
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
fine_blue
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
fine_blue
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
freya
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
freya
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
fruit
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
fruit
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
golden
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
golden
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
greenlcd
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
greenlcd
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
kellys
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
kellys
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
leo
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
leo
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
lucretia
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
lucretia
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
manxome
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
manxome
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
maroloccio
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
maroloccio
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
matrix
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
matrix
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
moe
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
moe
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
molokai
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
molokai
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
moria
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
moria
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
navajo-night
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
navajo-night
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
navy
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
navy
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
neon
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
neon
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
night
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
night
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
nightshimmer
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
nightshimmer
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
nuvola
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
nuvola
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
olive
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
olive
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
orion
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
orion
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
oxygenated
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
oxygenated
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
pablo
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
pablo
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
peaksea
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
peaksea
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
print
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
print
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
rand01
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
rand01
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
rdark
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
rdark
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
relaxedgreen
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
relaxedgreen
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
rootwater
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
rootwater
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
seashell
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
seashell
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
solarized-dark
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
solarized-dark
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
solarized-light
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
solarized-light
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
tabula
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
tabula
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
tcsoft
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
tcsoft
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
the
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
the
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
vampire
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
vampire
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
whitengrey
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
whitengrey
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
xoria256
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
xoria256
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
zellner
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
zellner
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
zenburn
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
zenburn
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
zmrok
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))
zmrok
01 #!/usr/bin/env python
02
03 fibs = {0: 0, 1: 1}
04 def fib(n):
05 if n in fibs: return fibs[n]
06 if n % 2 == 0:
07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n /
2)) * fib(n / 2)
08 return fibs[n]
09 else:
10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n
+1) / 2) ** 2)
11 return fibs[n]
12
13 print ("fib(234) = %i" % fib(234))

Contenu connexe

Tendances

How fast ist it really? Benchmarking in practice
How fast ist it really? Benchmarking in practiceHow fast ist it really? Benchmarking in practice
How fast ist it really? Benchmarking in practiceTobias Pfeiffer
 
Observational Science With Python and a Webcam
Observational Science With Python and a WebcamObservational Science With Python and a Webcam
Observational Science With Python and a WebcamIntellovations, LLC
 
Byterun, a Python bytecode interpreter - Allison Kaptur at NYCPython
Byterun, a Python bytecode interpreter - Allison Kaptur at NYCPythonByterun, a Python bytecode interpreter - Allison Kaptur at NYCPython
Byterun, a Python bytecode interpreter - Allison Kaptur at NYCPythonakaptur
 
Diving into byte code optimization in python
Diving into byte code optimization in python Diving into byte code optimization in python
Diving into byte code optimization in python Chetan Giridhar
 
Python profiling
Python profilingPython profiling
Python profilingdreampuf
 
Do snow.rwn
Do snow.rwnDo snow.rwn
Do snow.rwnARUN DN
 
Τα Πολύ Βασικά για την Python
Τα Πολύ Βασικά για την PythonΤα Πολύ Βασικά για την Python
Τα Πολύ Βασικά για την PythonMoses Boudourides
 
DeepLearning ハンズオン資料 20161220
DeepLearning ハンズオン資料 20161220DeepLearning ハンズオン資料 20161220
DeepLearning ハンズオン資料 20161220Mutsuyuki Tanaka
 
Goptuna Distributed Bayesian Optimization Framework at Go Conference 2019 Autumn
Goptuna Distributed Bayesian Optimization Framework at Go Conference 2019 AutumnGoptuna Distributed Bayesian Optimization Framework at Go Conference 2019 Autumn
Goptuna Distributed Bayesian Optimization Framework at Go Conference 2019 AutumnMasashi Shibata
 
집단지성 프로그래밍 08-가격모델링
집단지성 프로그래밍 08-가격모델링집단지성 프로그래밍 08-가격모델링
집단지성 프로그래밍 08-가격모델링Kwang Woo NAM
 
RではじめるTwitter解析
RではじめるTwitter解析RではじめるTwitter解析
RではじめるTwitter解析Takeshi Arabiki
 
What FizzBuzz can teach us about design
What FizzBuzz can teach us about designWhat FizzBuzz can teach us about design
What FizzBuzz can teach us about designMassimo Iacolare
 
Elixir & Phoenix – fast, concurrent and explicit
Elixir & Phoenix – fast, concurrent and explicitElixir & Phoenix – fast, concurrent and explicit
Elixir & Phoenix – fast, concurrent and explicitTobias Pfeiffer
 
start_printf: dev/ic/com.c comstart()
start_printf: dev/ic/com.c comstart()start_printf: dev/ic/com.c comstart()
start_printf: dev/ic/com.c comstart()Kiwamu Okabe
 

Tendances (20)

How fast ist it really? Benchmarking in practice
How fast ist it really? Benchmarking in practiceHow fast ist it really? Benchmarking in practice
How fast ist it really? Benchmarking in practice
 
Observational Science With Python and a Webcam
Observational Science With Python and a WebcamObservational Science With Python and a Webcam
Observational Science With Python and a Webcam
 
Byterun, a Python bytecode interpreter - Allison Kaptur at NYCPython
Byterun, a Python bytecode interpreter - Allison Kaptur at NYCPythonByterun, a Python bytecode interpreter - Allison Kaptur at NYCPython
Byterun, a Python bytecode interpreter - Allison Kaptur at NYCPython
 
Diving into byte code optimization in python
Diving into byte code optimization in python Diving into byte code optimization in python
Diving into byte code optimization in python
 
Python profiling
Python profilingPython profiling
Python profiling
 
Do snow.rwn
Do snow.rwnDo snow.rwn
Do snow.rwn
 
Τα Πολύ Βασικά για την Python
Τα Πολύ Βασικά για την PythonΤα Πολύ Βασικά για την Python
Τα Πολύ Βασικά για την Python
 
Python Tidbits
Python TidbitsPython Tidbits
Python Tidbits
 
FPBrno 2018-05-22: Benchmarking in elixir
FPBrno 2018-05-22: Benchmarking in elixirFPBrno 2018-05-22: Benchmarking in elixir
FPBrno 2018-05-22: Benchmarking in elixir
 
Profiling em Python
Profiling em PythonProfiling em Python
Profiling em Python
 
DeepLearning ハンズオン資料 20161220
DeepLearning ハンズオン資料 20161220DeepLearning ハンズオン資料 20161220
DeepLearning ハンズオン資料 20161220
 
Slides
SlidesSlides
Slides
 
Goptuna Distributed Bayesian Optimization Framework at Go Conference 2019 Autumn
Goptuna Distributed Bayesian Optimization Framework at Go Conference 2019 AutumnGoptuna Distributed Bayesian Optimization Framework at Go Conference 2019 Autumn
Goptuna Distributed Bayesian Optimization Framework at Go Conference 2019 Autumn
 
Lập trình Python cơ bản
Lập trình Python cơ bảnLập trình Python cơ bản
Lập trình Python cơ bản
 
Underscore
UnderscoreUnderscore
Underscore
 
집단지성 프로그래밍 08-가격모델링
집단지성 프로그래밍 08-가격모델링집단지성 프로그래밍 08-가격모델링
집단지성 프로그래밍 08-가격모델링
 
RではじめるTwitter解析
RではじめるTwitter解析RではじめるTwitter解析
RではじめるTwitter解析
 
What FizzBuzz can teach us about design
What FizzBuzz can teach us about designWhat FizzBuzz can teach us about design
What FizzBuzz can teach us about design
 
Elixir & Phoenix – fast, concurrent and explicit
Elixir & Phoenix – fast, concurrent and explicitElixir & Phoenix – fast, concurrent and explicit
Elixir & Phoenix – fast, concurrent and explicit
 
start_printf: dev/ic/com.c comstart()
start_printf: dev/ic/com.c comstart()start_printf: dev/ic/com.c comstart()
start_printf: dev/ic/com.c comstart()
 

Similaire à Highlight Utility Styles

関数プログラミングことはじめ revival
関数プログラミングことはじめ revival関数プログラミングことはじめ revival
関数プログラミングことはじめ revivalNaoki Kitora
 
Scala kansai summit-2016
Scala kansai summit-2016Scala kansai summit-2016
Scala kansai summit-2016Naoki Kitora
 
Haskellで学ぶ関数型言語
Haskellで学ぶ関数型言語Haskellで学ぶ関数型言語
Haskellで学ぶ関数型言語ikdysfm
 
関数プログラミングことはじめ in 福岡
関数プログラミングことはじめ in 福岡関数プログラミングことはじめ in 福岡
関数プログラミングことはじめ in 福岡Naoki Kitora
 
Class Customization and Better Code
Class Customization and Better CodeClass Customization and Better Code
Class Customization and Better CodeStronnics
 
Numerical Algorithm for a few Special Functions
Numerical Algorithm for a few Special FunctionsNumerical Algorithm for a few Special Functions
Numerical Algorithm for a few Special FunctionsAmos Tsai
 
The Ring programming language version 1.8 book - Part 53 of 202
The Ring programming language version 1.8 book - Part 53 of 202The Ring programming language version 1.8 book - Part 53 of 202
The Ring programming language version 1.8 book - Part 53 of 202Mahmoud Samir Fayed
 
Part2 from math import * from simpson import * k=1 def f(x): return (exp(-(x...
Part2 from math import * from simpson import *  k=1 def f(x): return (exp(-(x...Part2 from math import * from simpson import *  k=1 def f(x): return (exp(-(x...
Part2 from math import * from simpson import * k=1 def f(x): return (exp(-(x...hwbloom25
 
Finish the program below that does several bit-wise manipulations of.pdf
Finish the program below that does several bit-wise manipulations of.pdfFinish the program below that does several bit-wise manipulations of.pdf
Finish the program below that does several bit-wise manipulations of.pdffasttrackcomputersol
 
C Code and the Art of Obfuscation
C Code and the Art of ObfuscationC Code and the Art of Obfuscation
C Code and the Art of Obfuscationguest9006ab
 
Software Visualization - Promises & Perils
Software Visualization - Promises & PerilsSoftware Visualization - Promises & Perils
Software Visualization - Promises & PerilsMichele Lanza
 
Python 101 language features and functional programming
Python 101 language features and functional programmingPython 101 language features and functional programming
Python 101 language features and functional programmingLukasz Dynowski
 
funwithalgorithms.pptx
funwithalgorithms.pptxfunwithalgorithms.pptx
funwithalgorithms.pptxTess Ferrandez
 
A Few of My Favorite (Python) Things
A Few of My Favorite (Python) ThingsA Few of My Favorite (Python) Things
A Few of My Favorite (Python) ThingsMichael Pirnat
 

Similaire à Highlight Utility Styles (20)

関数プログラミングことはじめ revival
関数プログラミングことはじめ revival関数プログラミングことはじめ revival
関数プログラミングことはじめ revival
 
Scala kansai summit-2016
Scala kansai summit-2016Scala kansai summit-2016
Scala kansai summit-2016
 
Haskellで学ぶ関数型言語
Haskellで学ぶ関数型言語Haskellで学ぶ関数型言語
Haskellで学ぶ関数型言語
 
関数プログラミングことはじめ in 福岡
関数プログラミングことはじめ in 福岡関数プログラミングことはじめ in 福岡
関数プログラミングことはじめ in 福岡
 
Class Customization and Better Code
Class Customization and Better CodeClass Customization and Better Code
Class Customization and Better Code
 
HIDRAULICA DE CANALES
HIDRAULICA DE CANALESHIDRAULICA DE CANALES
HIDRAULICA DE CANALES
 
MP in Clojure
MP in ClojureMP in Clojure
MP in Clojure
 
Python Puzzlers
Python PuzzlersPython Puzzlers
Python Puzzlers
 
Numerical Algorithm for a few Special Functions
Numerical Algorithm for a few Special FunctionsNumerical Algorithm for a few Special Functions
Numerical Algorithm for a few Special Functions
 
14 recursion
14 recursion14 recursion
14 recursion
 
The Ring programming language version 1.8 book - Part 53 of 202
The Ring programming language version 1.8 book - Part 53 of 202The Ring programming language version 1.8 book - Part 53 of 202
The Ring programming language version 1.8 book - Part 53 of 202
 
Part2 from math import * from simpson import * k=1 def f(x): return (exp(-(x...
Part2 from math import * from simpson import *  k=1 def f(x): return (exp(-(x...Part2 from math import * from simpson import *  k=1 def f(x): return (exp(-(x...
Part2 from math import * from simpson import * k=1 def f(x): return (exp(-(x...
 
Finish the program below that does several bit-wise manipulations of.pdf
Finish the program below that does several bit-wise manipulations of.pdfFinish the program below that does several bit-wise manipulations of.pdf
Finish the program below that does several bit-wise manipulations of.pdf
 
C Code and the Art of Obfuscation
C Code and the Art of ObfuscationC Code and the Art of Obfuscation
C Code and the Art of Obfuscation
 
EUnit in Practice(Japanese)
EUnit in Practice(Japanese)EUnit in Practice(Japanese)
EUnit in Practice(Japanese)
 
Software Visualization - Promises & Perils
Software Visualization - Promises & PerilsSoftware Visualization - Promises & Perils
Software Visualization - Promises & Perils
 
Bash tricks
Bash tricksBash tricks
Bash tricks
 
Python 101 language features and functional programming
Python 101 language features and functional programmingPython 101 language features and functional programming
Python 101 language features and functional programming
 
funwithalgorithms.pptx
funwithalgorithms.pptxfunwithalgorithms.pptx
funwithalgorithms.pptx
 
A Few of My Favorite (Python) Things
A Few of My Favorite (Python) ThingsA Few of My Favorite (Python) Things
A Few of My Favorite (Python) Things
 

Dernier

Extrusion Processes and Their Limitations
Extrusion Processes and Their LimitationsExtrusion Processes and Their Limitations
Extrusion Processes and Their Limitations120cr0395
 
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service NashikCall Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service NashikCall Girls in Nagpur High Profile
 
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).pptssuser5c9d4b1
 
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICSHARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICSRajkumarAkumalla
 
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...ranjana rawat
 
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...Soham Mondal
 
Introduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptxIntroduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptxupamatechverse
 
Introduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxIntroduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxupamatechverse
 
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...ranjana rawat
 
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escortsranjana rawat
 
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escortsranjana rawat
 
Porous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writingPorous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writingrakeshbaidya232001
 
UNIT-III FMM. DIMENSIONAL ANALYSIS
UNIT-III FMM.        DIMENSIONAL ANALYSISUNIT-III FMM.        DIMENSIONAL ANALYSIS
UNIT-III FMM. DIMENSIONAL ANALYSISrknatarajan
 
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...Call Girls in Nagpur High Profile
 
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur High Profile
 
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...Dr.Costas Sachpazis
 
Introduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxIntroduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxupamatechverse
 
(RIA) Call Girls Bhosari ( 7001035870 ) HI-Fi Pune Escorts Service
(RIA) Call Girls Bhosari ( 7001035870 ) HI-Fi Pune Escorts Service(RIA) Call Girls Bhosari ( 7001035870 ) HI-Fi Pune Escorts Service
(RIA) Call Girls Bhosari ( 7001035870 ) HI-Fi Pune Escorts Serviceranjana rawat
 
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130Suhani Kapoor
 

Dernier (20)

Extrusion Processes and Their Limitations
Extrusion Processes and Their LimitationsExtrusion Processes and Their Limitations
Extrusion Processes and Their Limitations
 
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service NashikCall Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
 
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
 
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICSHARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
 
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
 
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
 
Introduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptxIntroduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptx
 
Introduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxIntroduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptx
 
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
 
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
 
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
 
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINEDJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
 
Porous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writingPorous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writing
 
UNIT-III FMM. DIMENSIONAL ANALYSIS
UNIT-III FMM.        DIMENSIONAL ANALYSISUNIT-III FMM.        DIMENSIONAL ANALYSIS
UNIT-III FMM. DIMENSIONAL ANALYSIS
 
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...
 
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
 
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
 
Introduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxIntroduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptx
 
(RIA) Call Girls Bhosari ( 7001035870 ) HI-Fi Pune Escorts Service
(RIA) Call Girls Bhosari ( 7001035870 ) HI-Fi Pune Escorts Service(RIA) Call Girls Bhosari ( 7001035870 ) HI-Fi Pune Escorts Service
(RIA) Call Girls Bhosari ( 7001035870 ) HI-Fi Pune Escorts Service
 
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
 

Highlight Utility Styles

  • 1. highlight themes Angie “@webchick” Byron September 2016 Brought to you by late-night yak shaving ;)
  • 2. What’s this then? • The highlight utility is oft-recommended as a way to add syntax-highlighted code to Keynote • It comes with numerous themes/styles (highlight -w) • Need for good contrast theme for presentations • However, the website only has a few samples
  • 3. How to use • This presentation demonstrates all themes, against both dark + light backgrounds • brew install highlight • highlight --style=XXX -O rtf file.ext • Example: • highlight --syntax=php5 --font-size=30 --style=autumn -O rtf index.php | pbcopy
  • 4. acid 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 5. acid 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 6. aiseered 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 7. aiseered 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 8. andes 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 9. andes 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 10. anotherdark 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 11. anotherdark 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 12. autumn 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 13. autumn 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 14. baycomb 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 15. baycomb 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 16. bclear 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 17. bclear 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 18. biogoo 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 19. biogoo 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 20. bipolar 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 21. bipolar 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 22. blacknblue 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 23. blacknblue 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 24. bluegreen 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 25. bluegreen 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 26. breeze 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 27. breeze 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 28. bright 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 29. bright 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 30. candy 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 31. candy 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 32. clarity 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 33. clarity 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 34. dante 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 35. dante 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 36. darkblue 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 37. darkblue 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 38. darkbone 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 39. darkbone 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 40. darkness 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 41. darkness 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 42. darkslategray 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 43. darkslategray 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 44. darkspectrum 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 45. darkspectrum 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 46. denim 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 47. denim 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 48. dusk 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 49. dusk 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 50. earendel 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 51. earendel 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 52. easter 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 53. easter 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 54. edit-anjuta 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 55. edit-anjuta 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 56. edit-eclipse 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 57. edit-eclipse 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 58. edit-emacs 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 59. edit-emacs 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 60. edit-flashdevelop 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 61. edit-flashdevelop 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 62. edit-gedit 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 63. edit-gedit 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 64. edit-jedit 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 65. edit-jedit 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 66. edit-kwrite 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 67. edit-kwrite 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 68. edit-matlab 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 69. edit-matlab 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 70. edit-msvs2008 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 71. edit-msvs2008 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 72. edit-nedit 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 73. edit-nedit 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 74. edit-vim-dark 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 75. edit-vim-dark 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 76. edit-vim 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 77. edit-vim 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 78. edit-xcode 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 79. edit-xcode 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 80. ekvoli 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 81. ekvoli 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 82. fine_blue 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 83. fine_blue 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 84. freya 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 85. freya 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 86. fruit 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 87. fruit 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 88. golden 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 89. golden 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 90. greenlcd 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 91. greenlcd 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 92. kellys 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 93. kellys 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 94. leo 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 95. leo 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 96. lucretia 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 97. lucretia 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 98. manxome 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 99. manxome 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 100. maroloccio 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 101. maroloccio 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 102. matrix 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 103. matrix 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 104. moe 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 105. moe 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 106. molokai 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 107. molokai 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 108. moria 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 109. moria 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 110. navajo-night 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 111. navajo-night 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 112. navy 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 113. navy 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 114. neon 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 115. neon 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 116. night 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 117. night 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 118. nightshimmer 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 119. nightshimmer 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 120. nuvola 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 121. nuvola 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 122. olive 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 123. olive 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 124. orion 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 125. orion 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 126. oxygenated 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 127. oxygenated 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 128. pablo 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 129. pablo 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 130. peaksea 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 131. peaksea 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 132. print 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 133. print 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 134. rand01 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 135. rand01 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 136. rdark 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 137. rdark 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 138. relaxedgreen 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 139. relaxedgreen 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 140. rootwater 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 141. rootwater 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 142. seashell 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 143. seashell 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 144. solarized-dark 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 145. solarized-dark 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 146. solarized-light 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 147. solarized-light 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 148. tabula 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 149. tabula 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 150. tcsoft 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 151. tcsoft 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 152. the 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 153. the 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 154. vampire 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 155. vampire 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 156. whitengrey 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 157. whitengrey 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 158. xoria256 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 159. xoria256 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 160. zellner 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 161. zellner 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 162. zenburn 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 163. zenburn 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 164. zmrok 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))
  • 165. zmrok 01 #!/usr/bin/env python 02 03 fibs = {0: 0, 1: 1} 04 def fib(n): 05 if n in fibs: return fibs[n] 06 if n % 2 == 0: 07 fibs[n] = ((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2) 08 return fibs[n] 09 else: 10 fibs[n] = (fib((n - 1) / 2) ** 2) + (fib((n +1) / 2) ** 2) 11 return fibs[n] 12 13 print ("fib(234) = %i" % fib(234))