forked from exercism/python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexample.py
More file actions
50 lines (35 loc) · 1.37 KB
/
example.py
File metadata and controls
50 lines (35 loc) · 1.37 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
from __future__ import division
try:
from math import gcd
except ImportError:
from fractions import gcd
class Rational(object):
def __init__(self, numer, denom):
# abs used for backward compatibility with fractions.gcd
gcd_num = abs(gcd(numer, denom))
self.numer = numer // gcd_num
self.denom = denom // gcd_num
if self.denom < 0:
self.numer *= -1
self.denom *= -1
def __eq__(self, other):
return self.numer == other.numer and self.denom == other.denom
def __repr__(self):
return '{}/{}'.format(self.numer, self.denom)
def __add__(self, other):
numer = (self.numer * other.denom) + (other.numer * self.denom)
return Rational(numer, other.denom * self.denom)
def __sub__(self, other):
return self + (-other)
def __mul__(self, other):
return Rational(self.numer * other.numer, self.denom * other.denom)
def __truediv__(self, other):
return Rational(self.numer * other.denom, self.denom * other.numer)
def __abs__(self):
return Rational(abs(self.numer), self.denom)
def __pow__(self, power):
return Rational(pow(self.numer, power), pow(self.denom, power))
def __rpow__(self, base):
return base ** (self.numer / self.denom)
def __neg__(self):
return Rational(self.numer * (-1), self.denom)