RE
查看原帖
RE
677581
_Glassy_Sky_楼主2023/8/28 20:34
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 5;
int a[MAXN];
int main()
{
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int n, k, l, r, sall, sk;
	cin >> n >> k >> l >> r >> sall >> sk;
	for(int i = 1; i <= k; i ++)
		a[i] += sk / k;
	if(sk % k > 0)
	{
		int cnt = sk % k, j = 1;
		while(cnt != 0)
		{
			a[j] ++;
			j ++;
		}
	}
	if(n - k == 0)
		return 0;
	for(int i = 1; i <= k; i ++)
		cout << a[i] << " ";
	for(int i = k + 1; i <= n; i ++)
		a[i] += (sall - sk) / (n - k);
	if((sall - sk) % (n - k) > 0)
	{
		int cnt = (sall - sk) % (n - k), j = k + 1;
		while(cnt != 0)
		{
			a[j] ++;
			j ++;
		}
	}
	for(int i = k + 1; i <= n; i ++)
		cout << a[i] << " ";
	return 0;
}

2023/8/28 20:34
加载中...