1708B - Difference of GCDs（数论构造）

一个数的倍数和这个数的GCD是这个数本身，所以题目转化为能否在L到R的范围内找到一所有1到n的倍数。

#include <iostream>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define int long long
#define endl '\n'
#define lowbit(x) x &(-x)
#define mh(x) memset(x, -1, sizeof h)
#define debug(x) cerr << #x << "=" << x << endl;
#define brk exit(0);
// const int N = 2e5 + 10;
const int mod = 998244353;
const double esp = 1e-6;
const double pi = acos(-1);
#define INF 0x3f3f3f3f
using namespace std;
const int N = 1e5 + 10;
int a[N], path[N], n, m;
void solve()
{
    int n,l,r;
    cin >> n>>l>>r;
    for (int i = 1; i <= n;i++)
    {
        int x = (l / i + (l % i == 0 ? 0 : 1) )* i;
        if(x<=r)
            path[i] = x;
        else {
            cout << "NO" << endl;
            return;
        }
    }
    cout << "YES" << endl;
    for (int i = 1; i <= n;i++)
        cout << path[i]  << " ";
        cout << endl;
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int T;
    cin >> T;
    while (T--)
        solve();
    return 0;
}