Loading...
More Python Posts
# Deleting all even numbers from a lista = [1,2,3,4,5]del a[1::2]print(a)
prime_lists=[] # a list to store the prime numbersdef prime(n): # define prime numbersif n <= 1:return False# divide n by 2... up to n-1for i in range(2, n):if n % i == 0: # the remainder should'nt be a 0return Falseelse:prime_lists.append(n)return Truefor n in range(30,1000): # calling function and passing starting point =30 coz we need primes >30prime(n)check=0 # a var to limit the output to 10 onlyfor n in prime_lists:for x in prime_lists:val= n *xif (val > 1000 ):check=check +1if (check <10) :print("the num is:", val , "=",n , "* ", x )break
def print_pyramid_pattern(n):# outer loop to handle number of rows# n in this casefor i in range(0, n):# inner loop to handle number of columns# values changing acc. to outer loopfor j in range(0, i+1):# printing starsprint("* ",end="")# ending line after each rowprint("\r")print_pyramid_pattern(10)
def key_of_min(d):return min(d, key = d.get)key_of_min({'a':4, 'b':0, 'c':13}) # b
import randomimport timedef generate_maze(width, height):"""Generate a random maze using depth-first search"""maze = [[1 for _ in range(width)] for _ in range(height)]def carve(x, y):maze[y][x] = 0directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]random.shuffle(directions)for dx, dy in directions:nx, ny = x + dx*2, y + dy*2if 0 <= nx < width and 0 <= ny < height and maze[ny][nx] == 1:maze[y + dy][x + dx] = 0carve(nx, ny)carve(1, 1)maze[0][1] = 0 # Entrancemaze[height-1][width-2] = 0 # Exitreturn mazedef print_maze(maze, path=None):"""Print the maze with ASCII characters"""if path is None:path = []for y in range(len(maze)):for x in range(len(maze[0])):if (x, y) in path:print('◍', end=' ')elif maze[y][x] == 0:print(' ', end=' ')else:print('▓', end=' ')print()def solve_maze(maze, start, end):"""Solve the maze using recursive backtracking"""visited = set()path = []def dfs(x, y):if (x, y) == end:path.append((x, y))return Trueif (x, y) in visited or maze[y][x] == 1:return Falsevisited.add((x, y))path.append((x, y))for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:if dfs(x + dx, y + dy):return Truepath.pop()return Falsedfs(*start)return path# Generate and solve a mazewidth, height = 21, 11 # Should be odd numbersmaze = generate_maze(width, height)start = (1, 0)end = (width-2, height-1)print("Generated Maze:")print_maze(maze)print("\nSolving Maze...")time.sleep(2)path = solve_maze(maze, start, end)print("\nSolved Maze:")print_maze(maze, path)
# Listlst = [1, 2, 3, 'Alice', 'Alice']# One-Linerindices = [i for i in range(len(lst)) if lst[i]=='Alice']# Resultprint(indices)# [3, 4]