方法一:找规律,两个数互质,最大不能组合出的数字是n*m-n-m
#include <iostream>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
cout << n * m - n - m;
return 0;
}
方法二
#include <iostream>
using namespace std;
int main()
{
int n, m;
scanf("%d%d", &n, &m);
int k = n * m;
while(k)
{
int t = k;
while(t % m != 0 && t - n > 0) t -= n;
if(t % m != 0 && k % n != 0 && k % m != 0)
{
printf("%d", k);
break;
}
k--;
}
return 0;
}