Skip to main content

Calculate Square Root

Nov 18, 2022AustinLeath
Loading...

More Python Posts

Fibonacci Series

Nov 18, 2022AustinLeath

0 likes • 8 views

#Python 3: Fibonacci series up to n
def fib(n):
a, b = 0, 1
while a < n:
print(a, end=' ')
a, b = b, a+b
print()
fib(1000)

print colored text to IDE terminal

Jun 1, 2023CodeCatch

0 likes • 2 views

from colorama import init, Fore
# Initialize colorama
init()
print(Fore.RED + "This text is in red color.")
print(Fore.GREEN + "This text is in green color.")
print(Fore.BLUE + "This text is in blue color.")
# Reset colorama
print(Fore.RESET + "This text is back to the default color.")

when predicate lambda

Nov 19, 2022CodeCatch

0 likes • 6 views

def when(predicate, when_true):
return lambda x: when_true(x) if predicate(x) else x
double_even_numbers = when(lambda x: x % 2 == 0, lambda x : x * 2)
print(double_even_numbers(2)) # 4
print(double_even_numbers(1)) # 1

Distinct Primes Finder > 1000

Nov 18, 2022AustinLeath

0 likes • 3 views

primes=[]
products=[]
def prime(num):
if num > 1:
for i in range(2,num):
if (num % i) == 0:
return False
else:
primes.append(num)
return True
for n in range(30,1000):
if len(primes) >= 20:
break;
else:
prime(n)
for previous, current in zip(primes[::2], primes[1::2]):
products.append(previous * current)
print (products)

radians to degrees

Nov 19, 2022CodeCatch

0 likes • 2 views

from math import pi
def rads_to_degrees(rad):
return (rad * 180.0) / pi
rads_to_degrees(pi / 2) # 90.0

xxx

Apr 27, 2025hasnaoui1

0 likes • 1 view

import random
import time
def 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] = 0
directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]
random.shuffle(directions)
for dx, dy in directions:
nx, ny = x + dx*2, y + dy*2
if 0 <= nx < width and 0 <= ny < height and maze[ny][nx] == 1:
maze[y + dy][x + dx] = 0
carve(nx, ny)
carve(1, 1)
maze[0][1] = 0 # Entrance
maze[height-1][width-2] = 0 # Exit
return maze
def 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 True
if (x, y) in visited or maze[y][x] == 1:
return False
visited.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 True
path.pop()
return False
dfs(*start)
return path
# Generate and solve a maze
width, height = 21, 11 # Should be odd numbers
maze = 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)