def Fibonacci(n): 
    if n<0: 
        print("Incorrect input") 
    # First Fibonacci number is 0 
    elif n==1: 
        return 0
    # Second Fibonacci number is 1 
    elif n==2: 
        return 1
    else: 
        return Fibonacci(n-1)+Fibonacci(n-2) 
  
# Driver Program 
  
print(Fibonacci(9))

class Rectangle:
    pass

class Square(Rectangle):
    pass

rectangle = Rectangle()
square = Square()

print(isinstance(rectangle, Rectangle))  # True
print(isinstance(square, Rectangle))     # True
print(isinstance(square, Square))        # True
print(isinstance(rectangle, Square))     # False

import itertools
import string
import time

def guess_password(real):
    chars = string.ascii_lowercase + string.ascii_uppercase + string.digits + string.punctuation
    attempts = 0
    for password_length in range(1, 9):
        for guess in itertools.product(chars, repeat=password_length):
            startTime = time.time()
            attempts += 1
            guess = ''.join(guess)
            if guess == real:
                return 'password is {}. found in {} guesses.'.format(guess, attempts)
            loopTime = (time.time() - startTime);
            print(guess, attempts, loopTime)

print("\nIt will take A REALLY LONG TIME to crack a long password. Try this out with a 3 or 4 letter password and see how this program works.\n")
val = input("Enter a password you want to crack that is 9 characters or below: ")
print(guess_password(val.lower()))

color2 = (60, 74, 172)
color1 = (19, 28, 87)

percent = 1.0
for i in range(101):
    resultRed = round(color1[0] + percent * (color2[0] - color1[0]))
    resultGreen = round(color1[1] + percent * (color2[1] - color1[1]))
    resultBlue = round(color1[2] + percent * (color2[2] - color1[2]))
    print((resultRed, resultGreen, resultBlue))
    percent -= 0.01

from functools import partial

def curry(fn, *args):
  return partial(fn, *args)
  
add = lambda x, y: x + y
add10 = curry(add, 10)
add10(20) # 30

# Python program to reverse a linked list
# Time Complexity : O(n)
# Space Complexity : O(n) as 'next'
#variable is getting created in each loop.

# Node class


class Node:

	# Constructor to initialize the node object
	def __init__(self, data):
		self.data = data
		self.next = None


class LinkedList:

	# Function to initialize head
	def __init__(self):
		self.head = None

	# Function to reverse the linked list
	def reverse(self):
		prev = None
		current = self.head
		while(current is not None):
			next = current.next
			current.next = prev
			prev = current
			current = next
		self.head = prev

	# Function to insert a new node at the beginning
	def push(self, new_data):
		new_node = Node(new_data)
		new_node.next = self.head
		self.head = new_node

	# Utility function to print the linked LinkedList
	def printList(self):
		temp = self.head
		while(temp):
			print temp.data,
			temp = temp.next


# Driver program to test above functions
llist = LinkedList()
llist.push(20)
llist.push(4)
llist.push(15)
llist.push(85)

print "Given Linked List"
llist.printList()
llist.reverse()
print "\nReversed Linked List"
llist.printList()