defis_prime(n):if n <2:returnFalsefor i inrange(2,int(n**0.5)+1):if n % i ==0:returnFalsereturnTruefor p inrange(2,32):num =2**p -1if is_prime(num):print(num)
堆叠相加
defcalculate_sum(a, n):result =0temp =0#符号—不代表变量,只是循环n次for _ inrange(n):temp = temp *10+ aresult += tempreturn result
#用map函数将输入的值转换为整数
a, n =map(int,input().split())print(calculate_sum(a, n))
defdetermine_grade(score, best):if score >= best -10:return'A'elif score >= best -20:return'B'elif score >= best -30:return'C'elif score >= best -40:return'D'else:return'F'n =int(input())
scores =list(map(int,input().split()))
best =max(scores)for i, score inenumerate(scores):grade = determine_grade(score, best)print(f'学生{i+1}分数为{score},等级为{grade}')
密码强度判断
import redefcheck_password_strength(password):digit = re.search(r'\d', password)lowercase = re.search(r'[a-z]', password)uppercase = re.search(r'[A-Z]', password)special_char = re.search(r'[!@#$%^&*(),.?":{}|<>]', password)if digit and lowercase and uppercase and special_char:return"强密码"elif(digit and lowercase)or(digit and uppercase) \or(lowercase and uppercase)or \(digit and lowercase and uppercase):return"中等强度"elif digit or lowercase or uppercase:return"弱密码"else:return"未知密码类型"password =input()print(check_password_strength(password))
斐波那契数列
#定义一个斐波那契数列函数deffibonacci(n):if n <=1:return na, b =0,1for _ inrange(2, n +1):c = a + ba = bb = creturn bn =int(input())print(fibonacci(n))