B. Not Dividing(构造)

Problem - B - Codeforces

题目保证一定有解，那么就不用统计操作次数，只考虑操作后的数组
给定n个数，用小于2*n次操作 （让某个数 + 1 ） 使得 后一个数不能整除前一个数
特判第一个为1 的情况，然后从小到大让如果需要操作的话就让后面的那个数 + 1

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <algorithm>
#define x first
#define y second
#define fu(i,a,b) for(int i=a;i<=b;i ++ )
#define fd(i,a,b) for(int i=a;i>=b;i -- )
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<LL,LL> PLL;
//typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 1e5+ 10,M = 1e5 + 10,INF = 0x3f3f3f3f ;
const int mod = 1e9;
const double eps = 1e-8;


int n;


inline void solve()
{
    cin >> n;
    vector<int> a(n);
    int ans =0 ;
    fu(i,0,n-1) cin >> a[i];
    if(a[0] < 2 ) a[0] ++ ;
    fu(i,1,n-1) 
    {
        while(a[i] % a[i-1] == 0 || a[i] < 2 ) 
        {
            a[i] ++ ;
        }
        
    }
    fu(i,0,n-1)
    cout << a[i] <<" \n"[i==n-1];
    
            
}



signed main()
{
//  freopen("1.txt","w",stdout);
     ios

    int t=1;
    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<< now ++ <<": ";
        solve();
    }


    return 0;
}