## lambda example

0 likes • Nov 19, 2022 • 0 views
Python

## More Python Posts

#### hex to rgb

0 likes • Nov 19, 2022 • 2 views
Python
```def hex_to_rgb(hex):  return tuple(int(hex[i:i+2], 16) for i in (0, 2, 4))
hex_to_rgb('FFA501') # (255, 165, 1)```

#### Plotting Fibonacci

0 likes • Nov 19, 2022 • 0 views
Python
`# Python program for Plotting Fibonacci # spiral fractal using Turtle import turtle import math   def fiboPlot(n):     a = 0    b = 1    square_a = a     square_b = b       # Setting the colour of the plotting pen to blue     x.pencolor("blue")       # Drawing the first square     x.forward(b * factor)     x.left(90)     x.forward(b * factor)     x.left(90)     x.forward(b * factor)     x.left(90)     x.forward(b * factor)       # Proceeding in the Fibonacci Series     temp = square_b     square_b = square_b + square_a     square_a = temp           # Drawing the rest of the squares     for i in range(1, n):         x.backward(square_a * factor)         x.right(90)         x.forward(square_b * factor)         x.left(90)         x.forward(square_b * factor)         x.left(90)         x.forward(square_b * factor)           # Proceeding in the Fibonacci Series         temp = square_b         square_b = square_b + square_a         square_a = temp       # Bringing the pen to starting point of the spiral plot     x.penup()     x.setposition(factor, 0)     x.seth(0)     x.pendown()       # Setting the colour of the plotting pen to red     x.pencolor("red")       # Fibonacci Spiral Plot     x.left(90)     for i in range(n):         print(b)         fdwd = math.pi * b * factor / 2        fdwd /= 90        for j in range(90):             x.forward(fdwd)             x.left(1)         temp = a         a = b         b = temp + b     # Here 'factor' signifies the multiplicative  # factor which expands or shrinks the scale # of the plot by a certain factor. factor = 1  # Taking Input for the number of  # Iterations our Algorithm will run n = int(input('Enter the number of iterations (must be > 1): '))   # Plotting the Fibonacci Spiral Fractal  # and printing the corresponding Fibonacci Number if n > 0:     print("Fibonacci series for", n, "elements :")     x = turtle.Turtle()     x.speed(100)     fiboPlot(n)     turtle.done() else:     print("Number of iterations must be > 0")`

#### Untitled

0 likes • Apr 21, 2023 • 0 views
Python
`print("hellur")`

#### integer to roman numeral

0 likes • Nov 19, 2022 • 0 views
Python
```def to_roman_numeral(num):  lookup = [    (1000, 'M'),    (900, 'CM'),    (500, 'D'),    (400, 'CD'),    (100, 'C'),    (90, 'XC'),    (50, 'L'),    (40, 'XL'),    (10, 'X'),    (9, 'IX'),    (5, 'V'),    (4, 'IV'),    (1, 'I'),  ]  res = ''  for (n, roman) in lookup:    (d, num) = divmod(num, n)    res += roman * d  return res
to_roman_numeral(3) # 'III'to_roman_numeral(11) # 'XI'to_roman_numeral(1998) # 'MCMXCVIII'```

#### Topological sort

0 likes • Nov 19, 2022 • 0 views
Python
`#Python program to print topological sorting of a DAGfrom collections import defaultdict  #Class to represent a graphclass Graph:    def __init__(self,vertices):        self.graph = defaultdict(list) #dictionary containing adjacency List        self.V = vertices #No. of vertices      # function to add an edge to graph    def addEdge(self,u,v):        self.graph[u].append(v)      # A recursive function used by topologicalSort    def topologicalSortUtil(self,v,visited,stack):          # Mark the current node as visited.        visited[v] = True          # Recur for all the vertices adjacent to this vertex        for i in self.graph[v]:            if visited[i] == False:                self.topologicalSortUtil(i,visited,stack)          # Push current vertex to stack which stores result        stack.insert(0,v)      # The function to do Topological Sort. It uses recursive     # topologicalSortUtil()    def topologicalSort(self):        # Mark all the vertices as not visited        visited = [False]*self.V        stack =[]          # Call the recursive helper function to store Topological        # Sort starting from all vertices one by one        for i in range(self.V):            if visited[i] == False:                self.topologicalSortUtil(i,visited,stack)          # Print contents of stack        print(stack)  g= Graph(6)g.addEdge(5, 2);g.addEdge(5, 0);g.addEdge(4, 0);g.addEdge(4, 1);g.addEdge(2, 3);g.addEdge(3, 1);  print("Following is a Topological Sort of the given graph")g.topologicalSort()`

#### Copy file to destination

0 likes • Nov 18, 2022 • 0 views
Python
```# importing the modulesimport osimport shutil
# getting the current working directorysrc_dir = os.getcwd()
# printing current directoryprint(src_dir)
# copying the filesshutil.copyfile('test.txt', 'test.txt.copy2') #copy src to dst
# printing the list of new filesprint(os.listdir())```