作业1、将上节课的作业,统统使用函数封装一次
作业4、判断以下哪些不能作为标识符
A、a
B、¥a
C、_12
D、$a@12
E、false
F、False
由字母(A-Z、a-z)、数字(0-9)、下划线(“_”)组成,并且首字符不能是数字。 答案是B、C、D、E、F
作业5:
输入数,判断这个数是否是质数(要求使用函数 + for循环)
def is_Prime(prime_number):
for i in range(2,prime_number):
if prime_number % i == 0:
return False #是合数
break
return True #是质数 不可以写else不能因为一个除不尽而认为是质数,所以要写在外面
def print_prime(flag):
if flag == True:
print("这个是质数")
else:
print("这个是合数")
flag = is_Prime(prime_number = int(input("输入一个数:")))
print_prime(flag)
作业6:求50~150之间的质数是那些?
def is_Prime(down_number, up_number):
for j in range(down_number,up_number):
flag = True
for i in range(2, j):
if j % i == 0:
flag = False #是合数
break
if flag:
print(f"质数是::{j}")
is_Prime(50, 150)
作业7:打印输出标准水仙花数,输出这些水仙花数
def IS_flower_number():
for bai in range(1, 10):
for shi in range(0, 10):
for ge in range(0, 10):
flower_number = bai * 100 + shi * 10 + ge
if flower_number == bai ** 3 + shi ** 3 + ge ** 3:
print(f"这个三位数是{flower_number}")
IS_flower_number()
作业8:验证:任意一个大于9的整数减去它的各位数字之和所得的差,一定能被9整除.
def judge_number(number1):
if 9 <= number1 <= 9999 :
return number1
else:
print("你的数字不符合条件")
def funtion_number(number):
a = number // 1000
b = number // 100 % 10
c = number // 10 % 10
d = number % 10
sum_number = a + b + c + d
if (number - sum_number) % 9 == 0:
print("验证正确,任意数字都符合这个条件")
else:
print("验证不正确")
number = judge_number(number1 = int(input("输入一个数字")))
funtion_number(number)
作业9:一个五位数,若在它的后面写上一个7,得到一个六位数A,若在它前面写上一个7,得到一个六位数B,B是A的五倍,求此五位数.
def judge_number():
for number in range(10000, 100000):
number1 = number + 700000
number2 = number * 10 + 7
if number1 / number2 == 5:
print(f"{number}")
judge_number()
作业10:有一种最简真分数,它们的分子与分母的乘积都是140,把
所有这样的真分数从小到大打印出来
def simple_fraction():
for fenmu in range(2, 141):
for fenzi in range(1,fenmu):
for factor in ls:
if fenmu * fenzi == 140:
if fenmu % factor != 0 and fenzi % factor != 0:
if fenmu % 2 != fenzi % 2:
print(f"{fenzi}/{fenmu}",end= "\t")
ls = [2,3,5,7]
simple_fraction()
作业11:某数被80除所得的商,不但是7的倍数,而且用2,3,4,5,6去
除余数都是1,求这 个自然数.
def find_number():
for i in range(0,9999):
if i % 80 == 0:
shang = i // 80
if shang % 7 == 0:
for j in ls:
if shang % j == 1:
print(f"符合这个条件的数是:{i}")
break
ls = list([2, 3, 4, 5, 6])
find_number()
作业12:编程求出满足以下条件的三位数:它除以11所得的商等于它各位数字之和
def find_number():
for i in range(100, 1000):
if i % 11 == 0:
Hundred = i // 100
ten = i % 100 // 10
ge = i % 10
if i // 11 == Hundred + ten + ge:
print(i)
find_number()
作业13:有一堆硬币,每次只能拿一个或者两个,求最少多少次可以拿完硬币
[10, 8, 5, 3, 27, 99]
def take_coin():
quantity = 0
total = 0
for index in range(0,len(ls)):
total += ls[index]
if total % 2 == 1:
count = total // 2 + 1
else:
count = total // 2
print(count)
ls = list([10,8,5,3,27,99])
take_coin()
作业15:求1~100之间不能被3整除的数之和
def count_num():
count = 0
for number in range(1, 101):
if number % 3 != 0:
count += number
print(f"1~100之间的数之和是:{count}")
count_num()
作业16:给定一个正整数N,找出1到N(含)之间所有质数的总和
def find_prime_sum(number):
count = 0
for i in range(2,number+1):
flag = True
for j in range(2, i):
if i % j == 0:
flag = False
break
if flag:
count += i
print(count)
number = int(input("请输入一个正整数N:"))
find_prime_sum(number)
作业19:计算PI(公式如下:PI=4(1-1/3+1/5-1/7+1/9-1.......)
def count_number():
PI = 0
for i in range(1,9999999,1):
if i % 2 == 1:
index = i - 1
PI += (1 / (2 * i - 1))
else :
PI += (-1) * (1 / (2 * i - 1))
print(f"{4 * PI}")
count_number()