此篇属于比赛题解集合(CF && AcWing Race)链接

欢迎留言讨论

Codeforces Round 856 (Div. 2) B : 传送门

code

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int N = 1e4 + 10;
int T;
int a[N];

void solve()
{
    int n; cin >> n;
    for(int i = 0;i < n;i ++)
        cin >> a[i];

    for(int i = 0;i < n;i ++)
        if(a[i] == 1)
            a[i] ++;

    for(int i = 1;i < n;i ++)
        while(!(a[i] % a[i - 1]))
            a[i] ++;

    for(int i = 0;i < n;i ++)
        cout << a[i] << ' ';

    cout << endl;
}

int main()
{
    cin >> T;
    while(T --)
      solve();

    return 0;
}