최대공약수와 최소공배수

#include <iostream>
using namespace std;

int main() {
  
  //유클리드호제법
  int a, b;
  cin>>a>>b;
  int GCD,LCM;
  int A=a;
  int B=b;
  
  while(1)
  {
    int r=a%b;
    
    if(r==0){
      GCD=b;
      break;
    }
    
    a=b;
    b=r;
  }
  
  LCM=A/GCD*B/GCD*GCD;
  
  cout<<GCD<<" "<<LCM;

  return 0;
}