最大公约数与最小公倍数
2015-10-18 19:43
309 查看
最大公约数是指能够被两个数都整除的最大整数 如45和30的最大公约数15
//最大公约数
public class Max {
public static void main(String[] args) {
Max m = new Max();
System.out.println(m.getMaxDivide());
}
public int getMaxDivide() {
Scanner sca1 = new Scanner(System.in);
Scanner sca2 = new Scanner(System.in);
int a = sca1.nextInt();
int b = sca2.nextInt();
int value=0;
int max = a > b ? a : b;
int min = a < b ? a : b;
if (max % min == 0) {
return min;
} else {
for (int i = 2; i < max; i++) {
if (max % i == 0 && min % i == 0) {
value= i;
}
}
return value;
}
}
}
最小公约数 可以同时整除两个数的最小整数
public class Min {
public static void main(String[] args) {
Min m=new Min();
System.out.println(m.getMinMuli());
}
public int getMinMuli(){
Scanner sca1 = new Scanner(System.in);
Scanner sca2 = new Scanner(System.in);
int a = sca1.nextInt();
int b = sca2.nextInt();
int max = a > b ? a : b;
int min = a < b ? a : b;
if(max%min==0){
return max;
}else{
for (int i = max; ; i++) {
if(i%max==0&&i%min==0){
return i;
}
}
}
}
}
//最大公约数
public class Max {
public static void main(String[] args) {
Max m = new Max();
System.out.println(m.getMaxDivide());
}
public int getMaxDivide() {
Scanner sca1 = new Scanner(System.in);
Scanner sca2 = new Scanner(System.in);
int a = sca1.nextInt();
int b = sca2.nextInt();
int value=0;
int max = a > b ? a : b;
int min = a < b ? a : b;
if (max % min == 0) {
return min;
} else {
for (int i = 2; i < max; i++) {
if (max % i == 0 && min % i == 0) {
value= i;
}
}
return value;
}
}
}
最小公约数 可以同时整除两个数的最小整数
public class Min {
public static void main(String[] args) {
Min m=new Min();
System.out.println(m.getMinMuli());
}
public int getMinMuli(){
Scanner sca1 = new Scanner(System.in);
Scanner sca2 = new Scanner(System.in);
int a = sca1.nextInt();
int b = sca2.nextInt();
int max = a > b ? a : b;
int min = a < b ? a : b;
if(max%min==0){
return max;
}else{
for (int i = max; ; i++) {
if(i%max==0&&i%min==0){
return i;
}
}
}
}
}