Codeforces Round #216 (Div. 2) B. Valera and Contest

B. Valera and Contest

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Valera loves to participate in competitions. Especially in programming contests. Today he has participated in the contest with his team, consisting of n students (including Valera). This contest was an individual competition, so each student in the team solved problems individually.

After the contest was over, Valera was interested in results. He found out that:

• each student in the team scored at least l points and at most r points;
• in total, all members of the team scored exactly sall points;
• the total score of the k members of the team who scored the most points is equal to exactly sk; more formally, if a1, a2, ..., an is the sequence of points earned by the team of students in the non-increasing order (a1 ≥ a2 ≥ ... ≥ an), then sk = a1 + a2 + ... + ak.

However, Valera did not find out exactly how many points each of n students scored. Valera asked you to recover any distribution of scores between the students of the team, such that all the conditions above are met.

Input

The first line of the input contains exactly six integers n, k, l, r, sall, sk (1 ≤ n, k, l, r ≤ 1000; l ≤ r; k ≤ n; 1 ≤ sk ≤ sall ≤ 106).

It's guaranteed that the input is such that the answer exists.

Output

Print exactly n integers a1, a2, ..., an — the number of points each student scored. If there are multiple solutions, you can print any of them. You can print the distribution of points in any order.

Sample test(s)

input

5 3 1 3 13 9

output

2 3 2 3 3 

input

5 3 1 3 15 9

output

3 3 3 3 3 

这个题目一直在第11组测试样例上过不了，后来发现是有sall=sk的情况没有考虑到，这个题我的思路是这样的。对于前k组最多的，我们可以将其平均分开，然后对于余数的话将其平均分开一组一个，肯定能够保证这几个条件，因为人家说了，只要一组满足条件的就行，所以这样做没错。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int num[100005];
int i,j;
int n,k,l,r,sall,sk;
int main()
{


    while(scanf("%d%d%d%d%d%d",&n,&k,&l,&r,&sall,&sk)!=EOF)
    {

     int na=1;//用来往数组中放置个数
     if(sk%k==0)
     {
          for(i=1;i<=k;i++)
          {
            num[i]=sk/k;

          }
     }
     else
     {
         int h=sk%k;//余数
         for(i=1;i<=k;i++)
         {
             num[i]=sk/k;
         }
         for(i=1;i<=h;i++)
         {
             num[i]++;
         }
     }
     //printf("fdkjflds\n");
     na=k;
     int s2=sall-sk;//剩余人数
     int k2=n-k;//剩余组数
     if(s2!=0)
     {


     if(s2%k2==0)
     {
         for(i=na+1;i<=n;i++)
         {
              num[i]=s2/k2;

         }
     }
     else
     {
         int h=s2%k2;
         for(i=na+1;i<=n;i++)
         {
             num[i]=s2/k2;
         }
         for(i=na+1;i<=na+h;i++)
         {
             num[i]++;
         }

     }
     }
     sort(num+1,num+n+1);
     //int sum=0;
     for(i=n;i>=1;i--)
     {
         //sum=sum+num[i];
         if(i!=n)
         {
             printf("%d ",num[i]);
         }
         else
         {
             printf("%d\n",num[i]);
         }
     }

  //  printf("%d   sum\n",sum);







    }
    return 0;
}