-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfraction.cpp
More file actions
220 lines (190 loc) · 5.15 KB
/
fraction.cpp
File metadata and controls
220 lines (190 loc) · 5.15 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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
#include "fraction.h"
fraction::fraction(int64_t n, int64_t d) : defaultMaxDen(1000) {
if (d == 0) {
fprintf(stderr, "Error: Please ensure denominator is non-zero\n");
exit(EXIT_FAILURE);
} else if (d < 0) {
//Multiply above and below by -1 to ensure denominator is non negative
numerator = -n;
denominator = -d;
} else {
numerator = n;
denominator = d;
}
}
fraction::~fraction() {
}
fraction & fraction::reduce() {
int64_t gcd = getGcd((numerator < 0) ? -numerator : numerator, denominator);
numerator /= gcd;
denominator /= gcd;
return *this;
}
fraction & fraction::setNumerator(int64_t n) {
numerator = n;
return *this;
}
fraction fraction::getReduced() const {
int64_t gcd = getGcd((numerator < 0) ? -numerator : numerator, denominator);
return fraction(numerator / gcd, denominator / gcd);
}
fraction fraction::operator * (const fraction &f) const {
return fraction(numerator * f.numerator, denominator * f.denominator).reduce();
}
fraction fraction::operator / (const fraction &f) const {
if (f.numerator < 0) {
//Multiply above and below by -1 to ensure resulting minus is expressed in numerator
return fraction(numerator * -f.denominator, denominator * -f.numerator).reduce();
} else {
return fraction(numerator * f.denominator, denominator * f.numerator).reduce();
}
}
fraction fraction::operator + (const fraction &f) const {
if(denominator == f.denominator) {
return fraction(numerator + f.numerator, denominator);
} else {
int64_t n1 = numerator * f.denominator;
int64_t n2 = f.numerator * denominator;
return fraction(n1 + n2, denominator * f.denominator).reduce();
}
}
fraction fraction::operator - (const fraction &f) const {
if(denominator == f.denominator) {
return fraction(numerator - f.numerator, denominator);
} else {
int64_t n1 = numerator * f.denominator;
int64_t n2 = f.numerator * denominator;
return fraction(n1 - n2, denominator * f.denominator).reduce();
}
}
fraction fraction::operator * (const double d) const {
return (*this * getBestRA(d, defaultMaxDen));
}
fraction fraction::operator / (const double d) const {
return (*this / getBestRA(d, defaultMaxDen));
}
fraction fraction::operator + (const double d) const {
return (*this + getBestRA(d, defaultMaxDen));
}
fraction fraction::operator - (const double d) const {
return (*this - getBestRA(d, defaultMaxDen));
}
fraction fraction::getBestRA(double x, const int64_t maxDen) {
int8_t multiplier = 1;
if (x < 0) {
x = -x;
multiplier = -1;
}
if (x > 1) {
int64_t add = floor(x);
x = x - add;
fraction ret = bestRA(x, maxDen);
return ret.setNumerator(multiplier * (ret.numerator + ret.denominator * add));
} else {
return bestRA(x, maxDen);
}
}
bool fraction::operator == (const fraction &f) const {
fraction f1 = this->getReduced();
fraction f2 = f.getReduced();
return (f1.numerator == f2.numerator && f1.denominator == f2.denominator);
}
bool fraction::operator != (const fraction &f) const {
return !(*(this) == f);
}
bool fraction::operator > (const fraction &f) const {
if (denominator == f.denominator) {
return (numerator > f.numerator);
} else {
int64_t n1 = numerator * f.denominator;
int64_t n2 = f.numerator * denominator;
return (n1 > n2);
}
}
bool fraction::operator < (const fraction &f) const {
if (denominator == f.denominator) {
return (numerator < f.numerator);
} else {
int64_t n1 = numerator * f.denominator;
int64_t n2 = f.numerator * denominator;
return (n1 < n2);
}
}
bool fraction::operator >= (const fraction &f) const {
if (denominator == f.denominator) {
return (numerator >= f.numerator);
} else {
int64_t n1 = numerator * f.denominator;
int64_t n2 = f.numerator * denominator;
return (n1 >= n2);
}
}
bool fraction::operator <= (const fraction &f) const {
if (denominator == f.denominator) {
return (numerator <= f.numerator);
} else {
int64_t n1 = numerator * f.denominator;
int64_t n2 = f.numerator * denominator;
return (n1 <= n2);
}
}
double fraction::toDouble() const {
return ((double) numerator / (double) denominator);
}
ostream & operator << (ostream &out, const fraction &f) {
out << f.numerator << " / " << f.denominator;
return out;
}
string fraction::toText() const {
ostringstream out;
out << numerator << " / " << denominator;
return out.str();
}
void fraction::display() const {
cout << toText() << endl;
}
/*
* ----------------------------Private methods---------------------------------
*/
int64_t fraction::getGcd(int64_t n, int64_t d) {
if(d > n) {
int64_t temp = n;
n = d;
d = temp;
}
int64_t r;
while(d != 0) {
r = n % d;
n = d;
d = r;
}
return n;
}
fraction fraction::bestRA(const double x, const int64_t maxDen) {
fraction a(0, 1);
fraction b(1, 1);
fraction temp;
double mid = 0.0;
while ((a.denominator <= maxDen) && (b.denominator <= maxDen)) {
temp = fraction(a.numerator + b.numerator, a.denominator + b.denominator);
mid = temp.toDouble();
if (x == mid) {
if (temp.denominator <= maxDen) {
return temp;
} else if (b.denominator > a.denominator) {
return b;
} else {
return a;
}
} else if (x > mid) {
a = temp;
} else {
b = temp;
}
}
if (a.denominator > maxDen) {
return b;
} else {
return a;
}
}