[公开]北京市第二儿童福利院困境儿童及特困人员医疗保障服务项目中标公告

222222/Python-Projects

/Python-Projects/Python-Projects/Project_1/Project_1/README.md
# Python-Projects
Python-Projects repository for my projects I've written in Python.

/Python-Projects/Python-Projects/Project_1/Project_1/README.md
import math

def square_root(num):
try:
result = math.sqrt(num)
return result
except ValueError:
return "Cannot take the square root of a negative number."

def is_prime(num):
if num <= 1:
return False
if num == 2:
return True
if num % 2 == 0:
return False
for i in range(3, int(math.sqrt(num)) + 1, 2):
if num % i == 0:
return False
return True

def prime_factors(num):
factors = []
for i in range(2, num + 1):
while num % i == 0:
factors.append(i)
num //= i
return factors

def gcd(a, b):
while b:
a, b = b, a % b
return a

def lcm(a, b):
return a * b // gcd(a, b)

def prime_numbers_in_range(start, end):
primes = []
for num in range(start, end + 1):
if is_prime(num):
primes.append(num)
return primes

def fibonacci_sequence(n):
sequence = []
a, b = 0, 1
for _ in range(n):
sequence.append(a)
a, b = b, a + b
return sequence

def factorial(n):
if n == 0:
return 1
result = 1
for i in range(1, n + 1):
result *= i
return result

def power(x, n):
if n == 0:
return 1
result = 1
for _ in range(n):
result *= x
return result

def is_palindrome(s):
s = s.lower().replace(" ", "")
return s == s[::-1]

def is_perfect_square(num):
if num < 0:
return False
root = math.sqrt(num)
return root == int(root)

def is_perfect_cube(num):
if num < 0:
return False
root = num (1/3)
return root == int(root)

def is_perfect_square_root(num):
return math.isqrt(num) 2 == num

def is_perfect_cube_root(num):
root = num (1/3)
return root == int(root)

def is_perfect_mersenne_number(p):
if p <= 0:
return False
m = 2 p - 1
return is_prime(m)

def is_perfect_even_number(num):
return num % 2 == 0 and is_perfect_number(num)

def is_perfect_odd_number(num):
return num % 2 != 0 and is_perfect_number(num)

def is_perfect_even_square(num):
return num % 4 == 0 and is_perfect_square(num)

def is_perfect_odd_square(num):
return num % 8 == 7 and is_perfect_square(num)

def is_perfect_even_cube(num):
return num % 6 == 0 and is_perfect_cube(num)

def is_perfect_odd_cube(num):
return num % 24 == 7 and is_perfect_cube(num)

def is_perfect_even_mersenne_number(p):
return is_perfect_even_number(2 p - 1)

def is_perfect_odd_mersenne_number(p):
return is_perfect_odd_number(2 p - 1)

def is_perfect_even_square_mersenne_number(p):
return is_perfect_even_square(2 p - 1)

def is_perfect_odd_square_mersenne_number(p):
return is_perfect_odd_square(2 p - 1)

def is_perfect_even_cube_mersenne_number(p):
return is_perfect_even_cube(2 **