Least Common Multiple and Greatest Common Divisor in c

#include 
#include 

int gcd( int m, int n)
{
while( m!= n) // execute loop until m == n
{
if( m > n)
m= m - n; // large - small , store the results in large variable
else
n= n - m;
}
return ( m); // m or n is GCD
}

int lcm( int m, int n)
{
int gcd( int, int);
return( m * n / gcd (m , n)); // product of 2 numbers / gcd is lcm
}

main()
{
int m, n , lcm( int, int), gcd( int ,int);
printf(" enter anyu 2 values \n");
scanf("%d%d", &m,&n);
printf(" gcd is %d\n", gcd( m, n));
printf(" lcm is %d\n", lcm(m , n));
getch();
}