求最大公约数和最小公倍数
//以前写的C，改成java了

public class NewClass {    //两个数的最大公约数,辗转相除法    public static int GCD(int m, int n)    {        int r;        int s;        s = m * n;        if (m < n) {            r = m;            m = n;            n = r;        }        while (n != 0) {            r = m % n;            m = n;            n = r;        }        return m;    }    //最小公倍数,这个偷懒了，直接m*n/GCD(m,n)    public static int LCM(int m,int n){        m=m*n/GCD(m,n);        return m;    }    public static void main(String[] args) {        int m,n;        m=GCD(1000,590);        n=LCM(256,120);        System.out.println("GCD:"+m);        System.out.println("LCM:"+n);    }}