-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFraction.cpp
144 lines (132 loc) · 3.17 KB
/
Fraction.cpp
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
//WAP to create a class Fraction and do basic operations of plus,minus,multiply and divide
#include <iostream>
#include <iomanip>
using namespace std;
class Fraction
{
private:int numerator;
int denomenator;
int gcd(int n1,int n2);
bool checkPrime(int n);
public: Fraction add(const Fraction& f1);
Fraction minus(const Fraction& f1);
Fraction multiply(const Fraction& f1);
Fraction divide(const Fraction& f1);
void const print();
Fraction()
{
numerator=0;
denomenator=1;
}
Fraction(int n,int d)
{
numerator=n;
denomenator=d;
}
};
bool Fraction::checkPrime(int n) //Function to check if prime
{
int ctr=0;
for(int i=1;i<=n/2;i++)
{
if(n%i==0) //Checking for divisibility
ctr++; //Increasing counter if divisible..
}
if(ctr==1)
return true;
else
return false;
}
int Fraction::gcd(int n1,int n2) //Function to Calculate Greatest Common Divisor
{
int pro=1;
for(int i=1;i<=n1,i<=n2;i++)
{
if(n1%i==0) //Checking for divisibility of n1
if(n2%i==0) //Checking for divisibility of n2
if(checkPrime(i)) //Checking for Prime
{
pro*=i;
n1/=i;
n2/=i;
i=1;
}
}
return pro;
}
Fraction Fraction::add(const Fraction& f)
{
Fraction f1;
int lcm=(denomenator*f.denomenator)/gcd(denomenator,f.denomenator);
f1.numerator=(((lcm/denomenator)*numerator)+((lcm/f.denomenator)*f.numerator));
f1.denomenator=lcm;
return f1;
}
Fraction Fraction::minus(const Fraction& f)
{
Fraction f1;
int lcm=(denomenator*f.denomenator)/gcd(denomenator,f.denomenator);
f1.numerator=(((lcm/denomenator)*numerator)-((lcm/f.denomenator)*f.numerator));
f1.denomenator=lcm;
return f1;
}
Fraction Fraction::multiply(const Fraction& f)
{
Fraction f1;
f1.numerator=(f.numerator*numerator);
f1.denomenator=(f.denomenator*denomenator);
return f1;
}
Fraction Fraction::divide(const Fraction& f)
{
Fraction f1;
f1.numerator=(numerator*f.denomenator);
f1.denomenator=(denomenator*f.numerator);
return f1;
}
void const Fraction::print()
{
if(numerator==0)
cout<<"0"<<endl;
else if(denomenator==0)
cout<<"Infinite"<<endl;
else if(denomenator==1)
cout<<numerator<<endl;
else if(numerator==denomenator)
cout<<"1"<<endl;
else
{
int temp=gcd(numerator,denomenator);
numerator=numerator/temp;
denomenator=denomenator/temp;
cout<<numerator<<"/"<<denomenator<<endl;
}
}
int main()
{
Fraction ob1,ob2,ob3,ob4;
int n1,d1,n2,d2;
cout<<"Enter Numerator of Fraction 1"<<endl;
cin>>n1;
cout<<"Enter Denomenator of Fraction 1"<<endl;
cin>>d1;
cout<<"Enter Numerator of Fraction 2"<<endl;
cin>>n2;
cout<<"Enter Denomenator of Fraction 2"<<endl;
cin>>d2;
Fraction ob(n1,d1);
Fraction ob5(n2,d2);
ob1=ob.add(ob5);
ob2=ob.minus(ob5);
ob3=ob.multiply(ob5);
ob4=ob.divide(ob5);
cout<<"\n Fraction after adding=";
ob1 .print();
cout<<"\n Fraction after subtracting=";
ob2.print();
cout<<"\n Fraction after multiplying=";
ob3.print();
cout<<"\n Fraction after dividing=";
ob4.print();
return 1;
}