题解 | 小苯的刷怪笼

#include <bits/stdc++.h>
#define ll long long
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int N=2e5+5;
int n,a,k,mik,mak;
signed main() {
    IOS
    cin >> n >> a >> k;
    if(n==1) {
        if(a!=k) cout << -1;
        else cout << k;
        return 0;
    }
    mik=(a+1)/2,mak=a-n/2;
    if(k<mik||k>mak) {
        cout << -1;
        return 0;
    }
    cout << max((a-k)-(n-2)/2,a-n+2-((a-k)-(n-2)/2)) << ' ' << min((a-k)-(n-2)/2,a-n+2-((a-k)-(n-2)/2)) << ' ';
    for(int i=3;i<=n;++i) cout << "1 ";
    return 0;
}