Answers to ACM platform questions from Shandong University of Technology C language 1181 C language experiment -- Minimum Public multiple and maximum public approx.

C language experiment-least common multiple and maximum Common Divisor Time Limit: 1000 ms Memory limit: 65536 K any questions? Click Here ^_^ Enter two positive integers from the keyboard, calculate the least common multiple and the maximum common number of the two positive integers, and output them. The input includes one row.
Two positive integers separated by spaces. Returns the least common multiple and the maximum common number of two integers. Sample Input

6 8

Sample output

24 2

# Include
Void main ()
{
Int p, r, m, n, s;
Scanf ("% d", & n, & m );
If (n {
S = n;
N = m;
M = s;
}
P = m * n;
While (m! = 0)
{
R = n % m;
N = m;
M = r;
}
Printf ("% d \ n", p/n, n );
}