-
Notifications
You must be signed in to change notification settings - Fork 1
/
Rational.java
66 lines (66 loc) · 1.62 KB
/
Rational.java
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
package three;
//201621123029董明超
public class Rational {
private int v1;
private int v2;
void InitRational(int v1, int v2){
this.v1=v1;
this.v2=v2;
}//初始化有理数分子,分母
Rational Add(Rational T1, Rational T2){
Rational T3 = new Rational();
int t;
T3.v2=T1.v2*T2.v2;
T3.v1=T1.v1*T2.v2+T2.v1*T1.v2;
t=Gcd(T3.v2,T3.v1);
T3.v2/=t;
T3.v1/=t;
return T3;
}//有理数相加函数
Rational Minus(Rational T1, Rational T2){
Rational T3 = new Rational();
int t;
T3.v2=T1.v2*T2.v2;
T3.v1=T1.v1*T2.v2-T2.v1*T1.v2;
t=Gcd(T3.v2,T3.v1);
T3.v2/=t;
T3.v1/=t;
return T3;
}//有理数相减
Rational Multiply(Rational T1, Rational T2){
Rational T3 = new Rational();
int t;
T3.v2=T1.v2*T2.v2;
T3.v1=T1.v1*T2.v1;
t=Gcd(T3.v2,T3.v1);
T3.v2/=t;
T3.v1/=t;
return T3;
}//有理数相乘
Rational Divide(Rational T1, Rational T2){
Rational T3 = new Rational();
T3.v2=T1.v1*T2.v2;
T3.v1=T1.v2*T2.v1;
int t;
t=Gcd(T3.v2,T3.v1);
T3.v2/=t;
T3.v1/=t;
return T3;
}//有理数相除
int Gcd(int m,int n){
int t;
while(m%n!=0)
{
t=n;
n=m%n;
m=t;
}
return n;
}//求两个数最大公约数以便约分
int GetRational(Rational T,int i){
if(i==1)
return T.v1;
else
return T.v2;
}//获得有理数的分子或者分母
}