최대공약수/최소공배수

1934번 문제 : 최소공배수

https://www.acmicpc.net/problem/1934

#include <iostream>
using namespace std;
 
int GetGCD(int a, int b)
{
    int c;
    while (b != 0)
    {
        c = a % b;
        a = b;
        b = c;
    }
    return a;
}
 
int main() {
    int inp;
    cin >> inp;
    
    while (inp > 0)
    {
        int x, y;
        cin >> x >> y;
 
        int gcd = GetGCD(x, y);
        int lcm = x * y / gcd;
        
        cout << lcm << endl;
 
        inp--;
    }
 
    return 0;
}

13241번 문제 : 최소공배수

https://www.acmicpc.net/problem/13241

#include <iostream>
using namespace std;
 
int GetGCD(long long int a, long long int b)
{
    long long int c;
    while (b != 0)
    {
        c = a % b;
        a = b;
        b = c;
    }
    return a;
}
 
int main() {
    long long int x, y;
    cin >> x >> y;
 
    long long int gcd = GetGCD(x, y);
    long long int lcm = x * y / gcd;
 
    cout << lcm << endl;
 
    return 0;
}

2609번 문제 : 최대공약수와 최소공배수

https://www.acmicpc.net/problem/2609

#include <iostream>
using namespace std;
 
int GetGCD(long long int a, long long int b)
{
    long long int c;
    while (b != 0)
    {
        c = a % b;
        a = b;
        b = c;
    }
    return a;
}
 
int main() {
    long long int x, y;
    cin >> x >> y;
 
    long long int gcd = GetGCD(x, y);
    long long int lcm = x * y / gcd;
 
    cout << gcd << endl;
    cout << lcm << endl;
 
    return 0;
}

3036번 문제 : 링

https://www.acmicpc.net/problem/3036

#include <iostream>
#include <vector>
using namespace std;
 
int GetGCD(int a, int b)
{
    int c;
    while (b != 0)
    {
        c = a % b;
        a = b;
        b = c;
    }
    return a;
}
 
int main() {
    int num;
    vector<int> v;
    cin >> num;
 
    while (num > 0) 
    {
        int inp;
        cin >> inp;
        v.push_back(inp);
        num--;
    }
 
    for (int i = 1; i < v.size(); i++)
    {
        int gcd = GetGCD(v.at(0), v.at(i));
        cout << v.at(0) / gcd << "/" << v.at(i) / gcd << endl;
    }
 
    return 0;
}