解题思路:
注意事项:
参考代码:
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, i, cnt = 0;
vector<bool> vis(1000000, false);
cin >> m >> n;
vis[m] = vis[n] = true;
int minV = min(m, n);
for (i = minV; cnt < minV; i++) {
if (vis[i]) {
vis[i+m] = vis[i+n] = true;
cnt++;
if (cnt == minV) {
cout << i - minV << endl;
return 0;
}
}
else {
cnt = 0;
}
}
return 0;
}
0.0分
0 人评分