C++ 找出三个数的最小公倍数加1 的前10个整数

#include<iostream>
using namespace std;

int main() {
    int a, b, c;
    cin >> a >> b >> c;
    
    int count = 0;
    int num = 1;
    while (count < 10) {
        if (num % a == 1 && num % b == 1 && num % c == 1) {
            cout << num << ' ';
            count++;
        }
        num++;
    }
    
    return 0;
}