两个整数的最大公约数和最小公倍数

# include <iostream>using namespace std;int main(){int m, n;int y = 1, b = 1;int temp;int count = 0;int z[20] = {1};cout << "Please input two numbers:\n";cin  >> m >> n;if(m > n){temp = m;m = n;n = temp;}for(int val = 2; val <= m; ){if((m % val == 0) && (n % val == 0)){z[count] = val;++count;m /= val;n /= val;}else{++val;}}for(val = 0; val < count; ++val){y = y * z[val];}b = y * m * n;cout << "最大公约数：" << y << endl << "最小公倍数：" << b << endl;return 0;}