Euclidean least common multiple of the greatest common divisor +

// Euclidean least common multiple of the greatest common factor + 
#include <stdio.h> void yinshu ( int A, int B) {
     int TEMP;
     the while (! A% B = 0 ) { 
        TEMP = A; 
        A = B; 
        B TEMP% = B; 
    } 
    the printf ( " % D \ n- " , B); 
} void beishu ( int A, int B) {
     int A1 = A;
     int B1 = B;
     int T;
    

while(a%b != 0){
        t = a;
        a= b;
        b = t % b;
    }
    printf("%d",a1/b*b1);
}
int main(){
    int a,b;
    scanf("%d %d",&a,&b);
    yinshu(a,b);
    beishu(a,b);
    return 0;
}