#include <iostream>
#include <algorithm>
#include <vector> using namespace std; int main(){
int n,k,l,r,s_n,s_k;
cin >> n >> k >> l >> r >> s_n >> s_k;
int s_n_k = s_n-s_k;
int average_k = s_k/k,left_k = s_k%k;
vector<int> a(n,);
for(int i = ; i < k ; ++ i ){
a[i] = average_k;
if(i < left_k) a[i]+=;
}
if(s_n_k){ //注意n和k相等的情况
int average_n_k = s_n_k / (n-k), left_n_k = s_n_k%(n-k);
for(int i = k ; i < n; ++ i){
a[i] = average_n_k;
if(i - k < left_n_k) a[i] +=;
}
}
cout<<a[];
for(int i = ; i < n ; ++ i) cout<<" "<<a[i];
cout<<endl;
return ;
}
相关文章
- Codeforces Round #251 (Div. 2) B. Devu, the Dumb Guy
- Codeforces Round #350 (Div. 2) B. Game of Robots __ interesting
- 【找规律】Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) B. Code For 1
- 贪心 Codeforces Round #303 (Div. 2) B. Equidistant String
- Codeforces Round #355 (Div. 2) B. Vanya and Food Processor 水题
- Codeforces Round #222 (Div. 1) B. Preparing for the Contest 二分+线段树
- Codeforces Round #246 (Div. 2) —B. Football Kit
- DFS Codeforces Round #290 (Div. 2) B. Fox And Two Dots
- Codeforces Round #425 (Div. 2) B. Petya and Exam(字符串模拟 水)
- Codeforces Round #170 (Div. 2) B. New Problem(好题)