Codeforces Round #816 (Div. 2) (B. Beautiful Array)

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    ll tst,n,k,b,s;

    cin>>tst;

    while(tst--)

    {

        vector<ll>vec;

        cin>>n>>k>>b>>s;

        if(((k*b)+(k-1)+((n-1)*(k-1)))<s || s<(k*b))

        {

            cout<<"-1"<<endl;

            continue;

        }

        ll pro=(k*b);

        s-=pro;

        for(ll i=1;i<n;i++)

        {

            if(s<k) vec.push_back(s),s=0;

            else if(s==0) vec.push_back(s);

            else vec.push_back(k-1),s-=(k-1);

        }

        vec.push_back(s+(k*b));

        sort(vec.begin(),vec.end());

        for(ll i=0;i<vec.size();i++) cout<<vec[i]<<" ";

        cout<<endl;

    }

}

///Alhamdulillah

Problem Link: https://codeforces.com/contest/1715/problem/B