最大公约数和最小公倍数模板

#include<bits/stdc++.h>
using namespace std;
 
//if a < b, it can swap their position.
long long gcd(long long a, long long b){
    a = abs(a);  b = abs(b);
    while(b != 0){
        long long t = a%b;
        a = b;
        b = t;
    }
    return a;
}
//you can choose one of them( gcd())
long long gcd(long long a, long long b){
  return (b==0) ? a : gcd(b,a%b);
}
//a * b = gcd(a,b) * lcm(a,b)
//divide before multiply avoid overflow,
long long lcm(long long a, long long b){
    return a / gcd(a,b) * b;
}

int  main()
{
	int a,b;
	cin>>a>>b;
	cout<<"you want"<<endl;
	return 0;
}