Rational.cpp 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373
  1. #include "Rational.h"
  2. #include <iostream>
  3. #include <cmath>
  4. using namespace std;
  5. int max(int a, int b) {
  6. if (a >= b)
  7. return a;
  8. return b;
  9. }
  10. int min(int a, int b) {
  11. if (a <= b)
  12. return a;
  13. return b;
  14. }
  15. Rational::Rational() {
  16. Chisl = 0;
  17. Znam = 1;
  18. sign = 0;
  19. }
  20. Rational::Rational(int _x) {
  21. Chisl = _x;
  22. Znam = 1;
  23. sign = _x < 0;
  24. }
  25. Rational::Rational(int _x, int _y) {
  26. sign = !((_x >=0 && _y >= 0) || (_x<0 && _y<0));
  27. Chisl = _x>=0 ? _x:-_x;
  28. Znam = _y>=0 ?_y:-_y;
  29. ;
  30. socr();
  31. }
  32. Rational::Rational(double _x) {
  33. //0x10000000000000
  34. unsigned long long int bits = *(unsigned long long int*)(&_x);
  35. sign = bits >> 63;
  36. long long int mant = (bits & 0xFFFFFFFFFFFFF) | 0x10000000000000;
  37. long long exp = (bits >> 52) & 0x7ff;
  38. exp -= 1075;
  39. //cout << hex << sign << '\t' << hex << mant << '\t' << hex << exp << '\t' << dec << bits << '\t' << hex << bits << '\n';
  40. long long t = ((long long int)1 << 52);
  41. //cout <<hex << t;
  42. long long num, denum;
  43. Chisl = mant;
  44. Znam = (pow(2,-exp));
  45. socr();
  46. }
  47. //ñîêðàùåíèå
  48. void
  49. Rational::socr() {
  50. sign = (!((Chisl >= 0 && Znam >= 0) || (Chisl < 0 && Znam < 0)))||sign;
  51. Chisl = Chisl >= 0 ? Chisl : -Chisl;
  52. Znam = Znam >= 0 ? Znam : -Znam;
  53. long long a, b,zero=0;
  54. a = Chisl;
  55. b = Znam;
  56. int end = 0;
  57. while (a != zero && b != zero && end!= INT_MAX) {
  58. //end++;
  59. if (a > b) {
  60. a %= b;
  61. }
  62. else
  63. b %= a;
  64. }
  65. if (end != INT_MAX) {
  66. Chisl /= (a + b);
  67. Znam /= (a + b);
  68. }
  69. }
  70. //êîðåíü
  71. const double
  72. Rational::root() {
  73. return sqrt(Chisl) / sqrt(Znam);
  74. }
  75. //îïåðàòîðû ôîðìàòà *=
  76. const Rational&
  77. Rational::operator += (const Rational& r) {
  78. long long obsh_znam = Znam * r.Znam;
  79. long long mod1, mod2;
  80. mod1 = sign ? -1 : 1;
  81. mod2 = r.sign ? -1 : 1;
  82. Chisl = Chisl * r.Znam * mod1 + r.Chisl * Znam * mod2;
  83. Znam = obsh_znam;
  84. sign = Chisl < 0;
  85. socr();
  86. return *this;
  87. }
  88. const Rational&
  89. Rational::operator -= (const Rational& r) {
  90. long long obsh_znam = Znam * r.Znam;
  91. long long mod1, mod2;
  92. mod1 = sign ? -1 : 1;
  93. mod2 = r.sign ? -1 : 1;
  94. Chisl = Chisl * r.Znam * mod1 - r.Chisl * Znam * mod2;
  95. Znam = obsh_znam;
  96. sign = (Chisl < 0);
  97. Chisl = Chisl >= 0 ? Chisl : -Chisl;
  98. socr();
  99. return *this;
  100. }
  101. const Rational&
  102. Rational::operator*=(const Rational& r) {
  103. Chisl = Chisl * r.Chisl;
  104. Znam = Znam * r.Znam;
  105. sign = !(sign == r.sign);
  106. socr();
  107. return *this;
  108. }
  109. const Rational&
  110. Rational::operator/=(const Rational& r) {
  111. Chisl = Chisl * r.Znam;
  112. Znam = Znam * r.Chisl;
  113. sign = !(sign == r.sign);
  114. socr();
  115. return *this;
  116. }
  117. //ñðàâíåíèå
  118. const bool&
  119. Rational::operator < (const Rational& r) {
  120. Rational r1 = *this;
  121. Rational r2 = r;
  122. r1.Chisl *= r2.Znam;
  123. r2.Chisl *= r1.Znam;
  124. return r1.Chisl < r2.Chisl;
  125. }
  126. const bool&
  127. Rational::operator > (const Rational& r) {
  128. Rational r1 = *this;
  129. Rational r2 = r;
  130. r1.Chisl *= r2.Znam;
  131. r2.Chisl *= r1.Znam;
  132. return r1.Chisl > r2.Chisl;
  133. }
  134. const bool&
  135. Rational::operator >= (const Rational& r) {
  136. Rational r1 = *this;
  137. Rational r2 = r;
  138. return !(r1 < r2);
  139. }
  140. const bool&
  141. Rational::operator<=(const Rational& r) {
  142. Rational r1 = *this;
  143. Rational r2 = r;
  144. return !(r1 > r2);
  145. }
  146. const bool&
  147. Rational::operator==(const Rational& r) {
  148. Rational r1 = *this;
  149. Rational r2 = r;
  150. r1.Chisl *= r2.Znam;
  151. r2.Chisl *= r1.Znam;
  152. return r1.Chisl == r2.Chisl;
  153. }
  154. const bool&
  155. Rational::operator!=(const Rational& r) {
  156. Rational r1 = *this;
  157. Rational r2 = r;
  158. return !(r1 == r2);
  159. }
  160. //ñëîæåíèå óìíîæåíèå
  161. const Rational&
  162. Rational::operator + (const Rational& r1) {
  163. Rational res = *this;
  164. res += r1;
  165. return res;
  166. }
  167. const Rational&
  168. Rational::operator - (const Rational& r1) {
  169. Rational res = *this;
  170. res -= r1;
  171. return res;
  172. }
  173. const Rational&
  174. Rational::operator * (const Rational& r1) {
  175. Rational res = *this;
  176. res *= r1;
  177. return res;
  178. }
  179. const Rational&
  180. Rational::operator / (const Rational& r1) {
  181. Rational res = *this;
  182. res /= r1;
  183. return res;
  184. }
  185. //ñ äðóãèì òèïîì ïåðåìåííûõ
  186. const Rational&
  187. Rational::operator *= (const int& r) {
  188. Chisl *= r;
  189. socr();
  190. return *this;
  191. }
  192. const Rational&
  193. Rational::operator/=(const int& r) {
  194. Znam *= r;
  195. socr();
  196. return *this;
  197. }
  198. const Rational&
  199. Rational::operator+=(const int& r) {
  200. Rational r_t = Rational(r);
  201. *this += r_t;
  202. return *this;
  203. }
  204. const Rational&
  205. Rational::operator-=(const int& r) {
  206. Rational r_t = Rational(r);
  207. *this -= r_t;
  208. return *this;
  209. }
  210. const Rational&
  211. Rational::operator * ( const int& i) {
  212. Rational res = *this;
  213. res *= i;
  214. return res;
  215. }
  216. const Rational&
  217. Rational::operator + (const int& i) {
  218. Rational res = *this;
  219. res += i;
  220. return res;
  221. }
  222. const Rational&
  223. Rational::operator - (const int& i) {
  224. Rational res = *this;
  225. res -= i;
  226. return res;
  227. }
  228. const Rational&
  229. Rational::operator / (const int& i) {
  230. Rational res = *this;
  231. res /= i;
  232. return res;
  233. }
  234. istream&
  235. operator >>(istream& is, Rational& r) {
  236. char input[10000];
  237. r.Chisl = 0;
  238. r.Znam = 1;
  239. r.sign = false;
  240. is >> input;
  241. int splitter = 0;
  242. bool checker;
  243. while (input[splitter] != '/' && input[splitter]) {
  244. splitter++;
  245. }
  246. checker = input[splitter] != '/';
  247. int dec = 1;
  248. for (int i = splitter - 1; i >= 0; i--) {
  249. if (input[i] != '-')
  250. r.Chisl += (input[i] - 48) * dec;
  251. else {
  252. r.sign = !r.sign;
  253. }
  254. dec *= 10;
  255. }
  256. if (!checker) {
  257. while (input[splitter])
  258. splitter++;
  259. dec = 1;
  260. r.Znam = 0;
  261. for (int i = splitter - 1; input[i] != '/'; i--) {
  262. if (input[i] != 45)
  263. r.Znam += (input[i] - 48) * dec;
  264. else{
  265. r.sign = !r.sign;
  266. }
  267. dec *= 10;
  268. }
  269. }
  270. r.socr();
  271. return is;
  272. }
  273. ostream&
  274. operator <<(ostream& os, Rational& r) {
  275. if (r.Chisl % r.Znam == 0)
  276. return os << "\n " << r.Chisl << '/' << r.Znam << "\n";
  277. double len_max = log10((double)max(r.Chisl, r.Znam));
  278. for (int i = 0; i < (int)(len_max - log10(r.Chisl)) / 2; i++) {
  279. os << " ";
  280. }
  281. os << " " << r.Chisl << endl;
  282. if (r.sign)
  283. os << '-' << ' ';
  284. else
  285. os << " ";
  286. for (int i = 0; i < len_max; i++) {
  287. os << "=";
  288. }
  289. os << endl << " ";
  290. for (int i = 0; i < (int)(len_max - log10(r.Znam)) / 2; i++) {
  291. os << " ";
  292. }
  293. os << r.Znam;
  294. return os;
  295. }