Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def gcd(self, a, b): # мой метод нахождения наибольшего общего делителя
- m = b
- if a < b:
- m = a
- for i in range(m, 1, -1):
- if a % i == 0 and b % i == 0:
- return i
- return 1
- def gcd(a,b): #копипаста с документации пайтона
- while b:
- a, b = b, a%b
- return a
- def reduction(self, t): # Сокращение
- temp = Fraction(1,1)
- k = self.gcd(t.num, t.denum)
- temp.num = t.num // k
- temp.denum = t.denum // k
- return temp
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement