寻找最大公因数和最小公倍数

Posted 2020-10-30 infinite-yc

package 寻找公因数;
import java.util.Scanner;
public class 寻找公因数 {
 public static void main(String[] args) { 
        Scanner in = new Scanner(System.in); 
        System.out.print("input x :"); 
        int x = in.nextInt(); 
        System.out.print("input y :"); 
        int y = in.nextInt(); 
         
        int z = Method(x,y);  
        System.out.println("最大公因数 : "+z); 
        System.out.println("最小公倍数 : "+(x*y/z)); 
 }
         //计算公约数

//辗转相除法
          public static int Method(int x,int y){ 
              int a,b,c; 
              a=x; 
              b=y; 
              while(b!=0){ 
                  c=a%b; 
                  a=b; 
                  b=c; 
              } 
              return a; 
          } 
        //求公倍数 
          public static int multiple(int x,int y){ 
              int z; 
              for(z=x;;z++){ 
                  if(z%x==0&&z%y==0){ 
                      break; 
                  } 
              } 
              return z; 
          } 
 
 }

  
       
     

input x :3
input y :5
辗转相除法：
最大公因数 : 1
最小公倍数 : 15