C :

#include<stdio.h>
int max(int x,int y)
{
        int ma,mi; 
        ma=x>y?x:y;
        mi=x<y?x:y;
        int i=0;
        for(i=mi;i>=1;i--)
        {
            if((!(ma%i))&&(!(mi%i)))
            {
                        break;
            }
        }
        return i;
}
int min(int x,int y)
{
        int max(int x,int y);
        int min(int x,int y);
        int i;
        int time=x*y;
        int ma,mi; 
        ma=x>y?x:y;
        mi=x<y?x:y;
        for(i=ma;i<=time;i++)
        {
             if((!(i%mi))&&(!(i%ma)))
             {
                 break;
             }
        }
        return i;
}

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

C++ :

#include<stdio.h>
int maxyueshu(int m,int n)  
 
{  int i=1,t;  
for(;i<=m&&i<=n;i++)  
{if(m%i==0&&n%i==0)  
 t=i;  
}  
return(t);  
}  
int minbeishu(int m,int n)  

{int j;  
if(m>=n) j=m;  
else j=n;  
for(;!(j%m==0&&j%n==0);j++);  
return j;  
}  
int main()  
{int a,b,max,min;  
//printf("enter two number is: ");  
scanf("%d%d",&a,&b);  
max=maxyueshu(a,b);  
min=minbeishu(a,b);  
printf("%d %d",max,min);  
return 0;
}

Java :

import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		final int n = 100000;
		
		Scanner input = new Scanner(System.in);
		
		int x = input.nextInt();
		int y = input.nextInt();
		int r,x1 = x,y1 = y,m;
		while(y != 0){
			r = x % y;
			x = y;
			y = r;
		}
		m = x * (x1 / x) * (y1 / x);
		System.out.println(x + " " + m);
		input.close();
	}
	
	

}

Python :

def max(a,b):
	if(a<b):
		a^=b
		b^=a
		a^=b
	while(a!=b):
		if(b>a-b):
			t=a-b
  			a=b
			b=t
		else:
			a=a-b
	return a
def min(a,b):
        if(a<b):
		a^=b
		b^=a
		a^=b
	i=2
	t=a
        while(t%b!=0):
                t=a*i
                i=i+1
        return t
a,b=raw_input('').split(' ')
print max(int(a),int(b)),min(int(a),int(b))