-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrat.cpp
More file actions
229 lines (195 loc) · 4.47 KB
/
rat.cpp
File metadata and controls
229 lines (195 loc) · 4.47 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
221
222
223
224
225
226
227
228
229
// implement "rat.h"
#include "rat.h"
//------------- constructors -----------------
void Rat::validate()
{
if (den == 0)
throw std::invalid_argument("demominator cannot be zero!");
else if (den < 0) {
num = -num;
den = -den;
}
}
Rat::Rat(const Int &n, const Int &d, const Int &i): num(n + i * d), den(d)
{
validate();
}
Rat::Rat(double d)
{
// I wonder is there a function like 'is_integer'?
// WARNING: this function fails if d is nearly infinity!!!
for (den = 1; (long long)d != d; den *= 2)
d *= 2;
num = Int(d);
reduce();
}
Rat::Rat(const std::string &str)
{
size_t i, j;
// i indicates '.' or '/' or end of str
for (i = 0; i != str.size() && str[i] != '.' && str[i] != '/'; ++i) {}
if (i == str.size()) {
// take as integer
// j indicates 'e' or 'E' or end of str
for (j = 0; j != str.size() && str[j] != 'e' && str[j] != 'E'; ++j) {}
num = Int(std::string(str, 0, j));
den = 1;
Int exp((j != str.size()) ? Int(std::string(str, j+1)) : 0);
if (exp < 0)
den *= Int(10).pow(-exp);
else
num *= Int(10).pow(exp);
} else if (str[i] == '.') {
// take as decimal
// j indicates 'e' or 'E' or end of str, j-i >= 1
for (j = i+1; j != str.size() && str[j] != 'e' && str[j] != 'E'; ++j) {}
num = Int(std::string(str, 0, i) + std::string(str, i+1, j-i-1));
den = 1;
Int exp(j-i-1 - ((j != str.size()) ? Int(std::string(str, j+1)) : 0));
if (exp < 0)
num *= Int(10).pow(-exp);
else
den *= Int(10).pow(exp);
} else { // if (str[i] == '/')
// take as rational
num = Int(std::string(str, 0, i));
den = Int(std::string(str, i+1));
validate();
}
reduce();
}
//--------------- reduce -----------------
void Rat::reduce()
{
Int d = gcd(num, den);
//std::cout << "num1: " << num << " den1: " << den << std::endl;
//std::cout << "gcd(num, den): " << d << std::endl;
num /= d;
den /= d;
//std::cout << "num2: " << num << " den2: " << den << std::endl;
}
//---------------- io ------------------
std::ostream &operator<<(std::ostream &os, const Rat &rhs)
{
if (rhs.den == 1)
os << rhs.num;
else
os << rhs.num << '/' << rhs.den;
return os;
}
std::istream &operator>>(std::istream &is, Rat &rhs)
{
std::string str;
is >> str;
try {
rhs = Rat(str);
} catch (const std::invalid_argument &) {
rhs = 0;
is.setstate(std::istream::failbit);
}
return is;
}
//--------------- relationship -----------------
bool operator==(const Rat &lhs, const Rat &rhs)
{
return lhs.num * rhs.den == lhs.den * rhs.num;
}
bool operator!=(const Rat &lhs, const Rat &rhs)
{
return !(lhs == rhs);
}
bool operator<(const Rat &lhs, const Rat &rhs)
{
return lhs.num * rhs.den < lhs.den * rhs.num;
}
bool operator>(const Rat &lhs, const Rat &rhs)
{
return rhs < lhs;
}
bool operator<=(const Rat &lhs, const Rat &rhs)
{
return !(rhs < lhs);
}
bool operator>=(const Rat &lhs, const Rat &rhs)
{
return !(lhs < rhs);
}
//-------------- arithmetic ---------------
Rat operator+(const Rat &lhs, const Rat &rhs)
{
//Int d = Rat::gcd(lhs.den, rhs.den);
//Rat ret(lhs.den / d * rhs.num + rhs.den / d * lhs.num, lhs.den / d * rhs.den);
Rat ret(lhs.den * rhs.num + rhs.den * lhs.num, lhs.den * rhs.den);
ret.reduce();
return ret;
}
Rat operator-(const Rat &lhs, const Rat &rhs)
{
//Int d = Rat::gcd(lhs.den, rhs.den);
//Rat ret(-lhs.den/d * rhs.num + rhs.den/d * lhs.num, lhs.den/d * rhs.den);
Rat ret(-lhs.den * rhs.num + rhs.den * lhs.num, lhs.den * rhs.den);
ret.reduce();
return ret;
}
Rat operator*(const Rat &lhs, const Rat &rhs)
{
Rat a(rhs.num, lhs.den), b(lhs.num, rhs.den);
a.reduce();
b.reduce();
return Rat(a.num * b.num, a.den * b.den);
}
Rat operator/(const Rat &lhs, const Rat &rhs)
{
Rat a(lhs.num, rhs.num), b(lhs.den, rhs.den);
a.reduce();
b.reduce();
Rat ret = Rat(a.num * b.num, a.den * b.den);
return ret;
}
Rat &Rat::operator+=(const Rat &rhs)
{
*this = *this + rhs;
return *this;
}
Rat& Rat::operator-=(const Rat &rhs)
{
*this = *this - rhs;
return *this;
}
Rat& Rat::operator*=(const Rat &rhs)
{
*this = *this * rhs;
return *this;
}
Rat& Rat::operator/=(const Rat &rhs)
{
*this = *this / rhs;
return *this;
}
Rat Rat::operator+() const
{
return *this;
}
Rat Rat::operator-() const
{
return Rat(-num, den);
}
Int Rat::to_Int() const
{
return num / den;
}
long double Rat::to_double() const
{
return num.to_double() / den.to_double();
}
Int Rat::gcd(Int a, Int b)
{
if (a < 0) a = -a;
if (b < 0) b = -b;
while (b != 0) {
Int c = a % b;
a = b;
b = c;
}
return a;
}