Created
November 15, 2022 16:55
-
-
Save RahulBRB/68e2c840cadb03dedb857788e4caa02a to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<iostream> | |
using namespace std; | |
class Fraction | |
{ | |
int numerator,denominator; | |
public: | |
Fraction(); | |
Fraction(int num,int deno); | |
Fraction operator+(Fraction a); | |
Fraction operator-(Fraction a); | |
Fraction operator*(Fraction a); | |
bool operator==(Fraction a); | |
Fraction& operator+=(const Fraction& rhs); | |
Fraction& operator-=(const Fraction& rhs); | |
Fraction& operator*=(const Fraction& rhs); | |
friend istream& operator>>(istream &in,Fraction &ob); | |
friend ostream& operator<<(ostream &out,const Fraction &ob); | |
private: | |
void minimize(); | |
int hcf(int num,int deno); | |
}; | |
Fraction::Fraction() | |
{ | |
this->numerator=0; | |
this->denominator=0; | |
} | |
Fraction::Fraction(int num,int deno) | |
{ | |
Fraction ob; | |
ob.numerator=num; | |
ob.denominator=deno; | |
ob.minimize(); | |
this->numerator=ob.numerator; | |
this->denominator=ob.denominator; | |
} | |
Fraction Fraction::operator+(Fraction a) | |
{ | |
Fraction res; | |
int lcm,max; | |
max=(this->denominator>a.denominator)?this->denominator:a.denominator; | |
while(true) | |
{ | |
if(max%this->denominator==0 && max%a.denominator==0) | |
{ | |
lcm=max; | |
break; | |
} | |
max++; | |
} | |
res.numerator=this->numerator*(lcm/this->denominator)+a.numerator*(lcm/a.denominator); | |
res.denominator=lcm; | |
res.minimize(); | |
return res; | |
} | |
Fraction Fraction::operator-(Fraction a) | |
{ | |
Fraction res; | |
int lcm,max; | |
max=(this->denominator>a.denominator)?this->denominator:a.denominator; | |
while(true) | |
{ | |
if(max%this->denominator==0 && max%a.denominator==0) | |
{ | |
lcm=max; | |
break; | |
} | |
max++; | |
} | |
res.numerator=this->numerator*(lcm/this->denominator)-a.numerator*(lcm/a.denominator); | |
res.denominator=lcm; | |
return res; | |
} | |
Fraction Fraction::operator*(Fraction a) | |
{ | |
Fraction res; | |
res.numerator=this->numerator*a.numerator; | |
res.denominator=this->denominator*a.denominator; | |
return res; | |
} | |
bool Fraction::operator==(Fraction a) | |
{ | |
if(this->denominator==a.denominator && this->numerator==a.numerator) | |
return true; | |
else | |
return false; | |
} | |
Fraction& Fraction::operator+=(const Fraction& rhs) | |
{ | |
int Max=max(this->denominator,rhs.denominator),lcm; | |
while(true) | |
{ | |
if(Max%this->denominator==0 && Max%rhs.denominator==0) | |
{ | |
lcm=Max; | |
break; | |
} | |
Max++; | |
} | |
this->numerator=this->numerator*(lcm/this->denominator)+rhs.numerator*(lcm/rhs.denominator); | |
this->denominator=lcm; | |
return *this; | |
} | |
Fraction& Fraction::operator-=(const Fraction& rhs) | |
{ | |
int Max=max(this->denominator,rhs.denominator),lcm; | |
while(true) | |
{ | |
if(Max%this->denominator==0 && Max%rhs.denominator==0) | |
{ | |
lcm=Max; | |
break; | |
} | |
Max++; | |
} | |
this->numerator=this->numerator*(lcm/this->denominator)-rhs.numerator*(lcm/rhs.denominator); | |
this->denominator=lcm; | |
return *this; | |
} | |
Fraction& Fraction::operator*=(const Fraction& rhs) | |
{ | |
this->numerator=this->numerator*rhs.numerator; | |
this->denominator=this->denominator*rhs.denominator; | |
return *this; | |
} | |
void Fraction::minimize() | |
{ | |
int fact_n,fact_d,h; | |
h=hcf(this->numerator,this->denominator); | |
this->numerator=this->numerator/h; | |
this->denominator=this->denominator/h; | |
} | |
int Fraction::hcf(int num,int deno) | |
{ | |
if(deno==0) | |
return num; | |
else | |
return hcf(deno,num%deno); | |
} | |
ostream& operator<<(ostream &out,const Fraction &ob) | |
{ | |
out << ob.numerator << '/' << ob.denominator; | |
return out; | |
} | |
int main() | |
{ | |
Fraction f1(2,4),f2(3,14),f3; | |
f3=f1+f2; | |
cout << f3; | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment