主要思想:找出最大公倍数并且约去
裁判测试程序样例:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
Fraction a = new Fraction(in.nextInt(), in.nextInt());
Fraction b = new Fraction(in.nextInt(),in.nextInt());
a.print();
b.print();
a.plus(b).print();
a.multiply(b).print();
in.close();
}
}
/* 请在这里填写答案 */
编写功能类:
class Fraction{//功能类 int fenzi,fenmu; Fraction(){} Fraction(int fenzi,int fenmu){ this.fenzi = fenzi; this.fenmu = fenmu; }//带参构造 public void print(){ int max=0,min=0,gys = 1; if(fenzi>fenmu){ max = fenzi; min = fenmu; } else{ max = fenmu; min = fenzi; }//找出二者较大数 for(int i = min; i>=2; i--){