gongyueshugongbeishuthoughkey.java

在java开发环境下求最大公约数和最小公倍数

import java.io.*; 
class Active
{  int n,m;
   public Active(int n1,int n2)
   { n=n1;
     m=n2;
   } 
    public int Gongyueshu()  
   { int x=n,y=m,r=0;
     r=x%y;
     while(r!=0)
     { x=y;
       y=r; 
       r=x%y;
     }
     return y;
   }
    public int Gongbeishu()
    { return n*m/Gongyueshu();
    }
   
 
   public void p()
   { 
     System.out.println(m+"和"+n+"的最大公约数"+Gongyueshu());
     System.out.println(m+"和"+n+"最小公倍数是"+Gongbeishu());
   }
}   
    class Keyboard
{
	public static int getInteger()throws IOException
	{
		BufferedReader inputStream = new BufferedReader 
                  (new InputStreamReader(System.in)); 
		
        return(Integer.valueOf(inputStream.readLine().trim()).intValue()); 

	}	
	public static double getReal()throws IOException
	{
	    BufferedReader inputStream = new BufferedReader 
                  (new InputStreamReader(System.in)); 
                  
		
        return(Double.valueOf(inputStream.readLine().trim()).doubleValue()); 	
    }
    public static String getString()throws IOException
    {
        BufferedReader inputStream = new BufferedReader 
                  (new InputStreamReader(System.in)); 
                  
		return(inputStream.readLine());	
    }
}
class GongyueshuGongbeishu
{ public static void main(String a[])throws IOException
   { int p,q;
  	  System.out.println("输入第1个整数：");
  	  p=Keyboard.getInteger(); 
  	  System.out.println("输入第2个整数：");  	  
  	  q=Keyboard.getInteger();
  	  Active b=new Active(p,q);
  	  b.p();
  }
   
}