最大公约数
代码如下:
# -*- coding = utf-8 -*-
# @Time : 2022/6/6 11:02
# @Author : lxw_pro
# @File : py-31.py
# @Software : PyCharm
# 欧几里得算法: 最大公约数
'''
gcd(a, b)=gcd(b, a mod b)
'''
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
def gcd2(a, b):
while b > 0:
r = a % b
a = b
b = r
return a
print(gcd(12, 16))
print(gcd2(16, 12))
欧几里得算法
代码如下:
# -*- coding = utf-8 -*-
# @Time : 2022/6/6 11:32
# @Author : lxw_pro
# @File : py-33.py
# @Software : PyCharm
class Fraction:
def __init__(self, a, b):
self.a = a
self.b = b
x = self.gcd(a, b)
self.a /= x
self.b /= x
def gcd(self, a, b):
while b > 0:
r = a % b
a = b
b = r
return a
def zgs(self, a, b):
x = self.gcd(a, b)
return a * b / x
def __add__(self, other):
a = self.a
b = self.b
c = other.a
d = other.b
fm = self.zgs(b, d)
fz = a * fm/b + c*fm/d
return Fraction(fz, fm)
def __str__(self):
return "%d/%d" % (self.a, self.b)
f = Fraction(20, 15)
z = Fraction(35, 45)
print(f+z)
有趣编程:
代码如下:
import turtle as t
t.color('red')
for i in range(270):
t.fd(i)
t.left(70)
t.done()
运行结果如下:
每日一言:
把每一件简单的事做好就是不简单,把每一件平凡的事做好就是不平凡。