没用函数写哦

#include <bits/stdc++.h>
using namespace std;
int a,b;
int m;
long long ab[10010],bb[10010];
int main(){
    cin >> a >> b;
    //最大公约数
    int m = min(a,b);
    for(int j = m;j >= 1;j--){
        if(a % j == 0 && b % j == 0){
            cout << "GCD="<< j << endl;
            break;
        }
    }
    //最小公倍数
    for(int i = 1;i <= b;i++){
        ab[i] = a * i;
    }
    for(int i = 1;i <= a;i++){
        bb[i] = b * i;
    }
    for(int i = 1;i <= b;i++){
        for(int j = 1;j <= a;j++){
            if(bb[j] == ab[i]){
                cout << "LCM=" << ab[i];
                return 0;
            }
        }
    }
    return 0;
}