#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define be begin()
#define en end()
#define fi first
#define se second
#define makep make_pair
#define nn int n; cin>>n
#define mm int m; cin>>m
#define kk int k; cin>>k
using namespace std;
int mod=1e9+7;
void ai(vector<int> &v){
for(auto &go : v){
cin>>go;
}
}
void yesno(int k){
if(k==1){
cout<<"Yes";
}
else{
cout<<"No";
}
}
void solve(){
nn;
kk;
mm;
vector<int> cevap(n);
if(m<n*k){
for(int i=0;i<n;i++){
if(m<=k){
cevap[i]=m;
for(int j=0;j<n;j++){
cout<<cevap[j]<<" ";
}
return;
}
else{
cevap[i]=k;
m-=k;
}
}
}
else{
m-=n*k;
int x=2*n-2;
x=x*k;
int c=m/x;
m=m%x;
for(int i=n-2;i>=0;i--){
if(m<=k){
cevap[i]+=m;
goto to;
}
else{
cevap[i]+=k;
m-=k;
}
}
for(int i=1;i<n;i++){
if(m<=k){
cevap[i]+=m;
goto to;
}
else{
cevap[i]+=k;
m-=k;
}
}
to:
for(int i=0;i<n;i++){
if(i==0||i==n-1){
cout<<cevap[i]+c*k+k<<" ";
}
else{
cout<<cevap[i]+2*c*k+k<<" ";
}
}
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t=1;
//cin>>t;
while(t--){
solve();
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
