利用递归实现99乘法表
时间: 2024-06-03 18:11:18 浏览: 8
好的,很高兴回答您的问题。以下是利用递归实现99乘法表的代码示例:
def print_multiplication_table(n):
if n ==1:
print("1 * 1 = 1")
return
else:
print_multiplication_table(n-1)
for i in range(1, n+1):
print("{} * {} = {}".format(i, n, i*n))
使用该函数,您可以输出1到n乘法表的结果。例如,输入n=9,将输出以下结果:
1 * 1 = 1
1 * 2 = 2
2 * 2 = 4
1 * 3 = 3
2 * 3 = 6
3 * 3 = 9
1 * 4 = 4
2 * 4 = 8
3 * 4 = 12
4 * 4 = 16
1 * 5 = 5
2 * 5 = 10
3 * 5 = 15
4 * 5 = 20
5 * 5 = 25
1 * 6 = 6
2 * 6 = 12
3 * 6 = 18
4 * 6 = 24
5 * 6 = 30
6 * 6 = 36
1 * 7 = 7
2 * 7 = 14
3 * 7 = 21
4 * 7 = 28
5 * 7 = 35
6 * 7 = 42
7 * 7 = 49
1 * 8 = 8
2 * 8 = 16
3 * 8 = 24
4 * 8 = 32
5 * 8 = 40
6 * 8 = 48
7 * 8 = 56
8 * 8 = 64
1 * 9 = 9
2 * 9 = 18
3 * 9 = 27
4 * 9 = 36
5 * 9 = 45
6 * 9 = 54
7 * 9 = 63
8 * 9 = 72
9 * 9 = 81
希望这个代码能帮助您回答问题。谢谢!