1 Star 0 Fork 0

yellow/201621123045黄子颖有理数

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
Rational.java 1.41 KB
一键复制 编辑 原始数据 按行查看 历史
yellow 提交于 2017-09-30 18:25 . Upload Rational.java
import java.util.Scanner;
public class Rational
{
private int v1;
private int v2;
public Rational(int v1, int v2)//201621123045 ӱ
{
this.v1 = v1;
this.v2 = v2;
}
public int getV1()//201621123045 ӱ
{
return v1;
}
public void setV1(int v1)//201621123045 ӱ
{
this.v1 = v1;
}
public int getV2()//201621123045 ӱ
{
return v2;
}
public void setV2(int v2)//201621123045 ӱ
{
this.v2 = v2;
}
public Rational()
{
}
public int Gcd(int m,int n)//201621123045 ӱ
{
int t;
while(m%n!=0)
{
t=n;
n=m%n;
m=t;
}
return n;
}
public static void Add(Rational T1,Rational T2,Rational T3)//201621123045 ӱ
{
int t;
T3.v2 = T1.v2*T2.v2;
T3.v1 = T1.v1*T2.v2+T2.v1*T1.v2;
t=T3.Gcd(T3.v1, T3.v2);
T3.v2/=t;
T3.v1/=t;
}
public static void Multiply(Rational T1,Rational T2,Rational T3)//201621123045 ӱ
{
T3.v2 = T1.v2*T2.v2;
T3.v1 = T1.v1*T2.v1;
int t = T3.Gcd(T3.v1, T3.v2);
T3.v2/=t;
T3.v1/=t;
}
public static void main(String[] args)//201621123045 ӱ
{
Scanner in = new Scanner(System.in);
Rational T3 = new Rational();
Rational T1 = new Rational(in.nextInt(),in.nextInt());
Rational T2 = new Rational(in.nextInt(),in.nextInt());
Add(T1,T2,T3);
System.out.println(T3.v1+" "+T3.v2);
Multiply(T1,T2,T3);
System.out.println(T3.v1+" "+T3.v2);
}
}
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/yellower/201621123045HuangZiYingYouLiShu.git
git@gitee.com:yellower/201621123045HuangZiYingYouLiShu.git
yellower
201621123045HuangZiYingYouLiShu
201621123045黄子颖有理数
master

搜索帮助