C :

#include <stdio.h>
int lcm(int a, int b)
{
  int leastcm, max, i;
  max = a>b?a:b;
  for(i=max; i<=a*b; i++)
  {
    if(i%a==0 && i%b==0)
    {
      leastcm = i;
      break;
    }
  }
  return leastcm;
}

int main()
{
  int a, b, leastcm;
  scanf("%d%d", &a, &b);
  leastcm = lcm(a, b);
  printf("%d\n", leastcm);
  return 0;
}

C++ :

#include<stdio.h>
int main()
{
  int dgy(int,int);
  int l,x,z,xgb;
  scanf("%d%d",&l,&x);
  z=dgy(l,x);
  xgb=l*x/z;
  printf("%d\n",xgb);
  return 0;
}

int dgy(int l,int x)
{int q,w;
 if(x>l)
 {q=l;l=x;x=q;}
 while((w=l%x)!=0)
 {
   l=x;
   x=w;
 }
 return(x);
}

Pascal :

var m,n:longint;
function f(m,n:longint):longint;
var r:longint;
begin
r:=m mod n;
m:=n;
n:=r;
if n=0 then f:=m else f:=f(m,n);
end;
begin
read(m,n);
writeln(m*n div f(m,n));
end.