3723. 最小公倍数

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;

    // Special Judge: n == 1, put 1.
    if (n == 1) {
        cout << "1\n";
        return EXIT_SUCCESS;
    }

    int dates[200000];
    vector<int> intervals;
    cin >> dates[0];    // first day is 1, not needed.
    for (int i = 1; i < n; ++i) {
        cin >> dates[i];
        --dates[i];     // -1 to show the interval.
        bool has_divisor = false;
        for (auto j : intervals)
            if (dates[i] % j == 0) {
                has_divisor = true;
                break;
            }
        if (has_divisor == false) {
            intervals.push_back(dates[i]);
        }
    }
    cout << intervals.size() << '\n';
}

using namespace std;
int main()
{
        int n;
        scanf("%d",&n);
        vector<int>num;
        vector<int>sd;
        for(int i=0;i<n;i++){
                int s;
                scanf("%d",&s);
                num.push_back(s);
        }
        int i,j,k=0,mass[n];
        for(i=1;i<num.size();i++){
                mass[k++]=num[i]-1;
        }
        sd.push_back(num[1]-num[0]);
        for(i=0;i<k;i++){
                for(j=0;j<sd.size();j++){
                        if(mass[i]%sd[j]==0){
                                break;
                        }
                }
                if(j>=sd.size()){
                        sd.push_back(mass[i]);
                }
        }
        printf("%d\n",sd.size());
}

for(int i = 0; i < n; i++)
    scanf("%d", &dates[i]);

if(n == 1)
    printf("1\n");
else
    printf("%d\n", solve(n));