1015 最大公约数和最小公倍数

#include<iostream>using namespace std;int gcd(int a,int b){int x,y,r;if(a>b){x=a;y=b;}else{x=b;y=a;}r=x%y;while(r){x=y;y=r;r=x%y;}return y;}int gongbei(int a,int b){int i,j,k;k=gcd(a,b);i=a/k;j=b/k;return k*i*j;} int main(){int a,b;while(cin>>a>>b){cout<<gcd(a,b)<<" "<<gongbei(a,b);}return 0;}