磕代码：c/c++/java：输入两个数，求最大公约数和最小公倍数；辗转相除法；while在c和java中的不同用法；

c:

#include<stdio.h>
int main(){
    long a,b,min,n;
    scanf("%ld %ld",&a,&b);
    /**for(int i=1;i<a+1;i++){
        if(a%i==0&&b%i==0)min=i;
    }
    for(int i=a;i<a*b+1;i++){
        if(i%a==0&&i%b==0)
            break;
        max=i+1;
    }
    
    printf("%ld",max+min);**/
    min=a%b;
    n=a*b;
    while(min){
        a=b;
        b=min;
        min=a%b;
    }
    printf("%ld",b+n/b);
}
//辗转相除法找最大公约数，最小公倍数=a*b/最大公约数；10的9次方用long

c++:

#include<bits/stdc++.h>
using namespace std;
int main(){
    long a,b,n,r;
    cin>>a>>b;
    r=a%b;
    n=a*b;
    while(r){
        a=b;
        b=r;
        r=a%b;
    }
    cout<<b+n/b;
}

java:

import java.io.*;
public class Main{
    public static void main(String[]args)throws IOException{
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String[]s=br.readLine().split(" ");
        long a=Integer.parseInt(s[0]);
        long b=Integer.parseInt(s[1]);
        long r,n;
        n=a*b;
        while(a%b!=0){
            r=a%b;
            a=b;
            b=r;
        }
        System.out.print(b+n/b);
    }
}