CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) 补题记录（A~A）

合集 - CodeForces 比赛合集(19)

1.CodeForces Round #939(Div. 2) 补题记录（A~F）2024-04-16

2.CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) 补题记录（A~A）2024-04-17

3.Educational Codeforces Round 163 (Rated for Div. 2) 补题记录（A~D）2024-04-174.CodeForces Round #951(Div. 2) 补题记录（A~E）2024-06-075.Codeforces Global Round 26 补题记录（A~C2）2024-06-106.CodeForces Round #959 sponsored by NEAR (Div. 1 + Div. 2) 补题记录（A~E）2024-07-207.Codeforces Round 960 (Div. 2) 补题记录（A~D）2024-07-218.Codeforces Round 961 (Div. 2) 补题记录（A~D）2024-07-249.Codeforces Round 962 (Div. 3) 补题记录（A~G）2024-07-2710.Pinely Round 4 (Div. 1 + Div. 2) 补题记录（A~F）2024-07-2911.Educational Codeforces Round 168 (Rated for Div. 2) 补题记录（A~E）2024-07-3112.Codeforces Round 963 (Div. 2) 补题记录（A~D，F1）2024-08-0513.Codeforces Round 964 (Div. 4) 补题记录（A~G2）2024-08-0714.Codeforces Round 965 (Div. 2) 补题记录（A,B,D,E1）2024-08-1115.EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) 补题记录（A~D1，E）2024-08-1216.Educational Codeforces Round 169 (Rated for Div. 2) 补题记录（A~F）2024-08-1617.Codeforces Round 972 (Div. 2) 补题记录（A~C,E1）2024-09-1618.Codeforces Round 988 (Div. 3) 补题记录（A~G）2024-11-1819.Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) 补题记录（A~E）2024-12-01

收起

A

猜测结论。发现当且仅当 $k=1$ 或者 $n=k$ 时有解，否则无解。

对于 $k=1$ 时构造序列 $1,2,3,\dots ,n$ 满足条件。

对于 $k=n$ 时构造序列 $1,1,1,\dots ,1$ 满足条件。

时间复杂度为 $O(n)$。

#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
    int T;
    cin >> T;
    while (T--) {
        int a, b;
        cin >> a >> b;
        if (b == 1) {
            for (int i = 1; i <= a; i++)
                cout << i << ' ';
            cout << '\n';
        } else if (b == a) {
            for (int i = 1; i <= a; i++)
                cout << "1 ";
            cout << '\n';
        } else {
            cout << "-1\n";
        }
    }
    return 0;
}