백준
[2609] 최대공약수와 최소공배수
Jcoder
2018. 8. 12. 18:01
#include<iostream>using namespace std;int gcd(int m, int n);int lcm(int m, int n);int main(){int a, b;cin >> a >> b;cout << gcd(a, b) << "\n" << lcm(a, b) << endl;return 0;}int gcd(int m, int n){if (n == 0)return m;return gcd(n, m % n);}int lcm(int m, int n){return m * n / gcd(m, n);}