B. Valera and Contest
来源:互联网 发布:降低媒体音量软件 编辑:程序博客网 时间:2024/05/03 03:18
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, ifa1, 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.
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.
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.
5 3 1 3 13 9
2 3 2 3 3
5 3 1 3 15 9
3 3 3 3 3
解题说明:模拟题,看懂题意即可
#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>using namespace std;int main(){int n,k,r,l,sa,sk,i;scanf("%d%d%d%d%d%d",&n,&k,&l,&r,&sa,&sk);int x=sk/k;int y=sk%k;for(i=0;i<y;i++){printf("%d ",x+1);}for(i=0;i<k-y;i++){printf("%d ",x);}if(n-k!=0){ x=(sa-sk)/(n-k); y=(sa-sk)%(n-k);for(i=0;i<y;i++){printf("%d ",x+1);}for(i=0;i<n-k-y;i++){printf("%d ",x);}}printf("\n");return 0;}
- B. Valera and Contest
- B. Valera and Contest----模拟
- CodeForces 369B Valera and Contest
- codeforce Valera and Contest
- Codeforces Round #216 (Div. 2) B. Valera and Contest
- Codeforces Round #216 (Div. 2) B. Valera and Contest
- B. Valera and Fruits
- C - Valera and Contest题解
- codeforces252-B - Valera and Fruits
- Codeforces 441 B. Valera and Fruits
- CodeForces 441B Valera and Fruits
- codeforces-441B-Valera and Fruits【暴力】
- CF #252 div2 B - Valera and Fruits
- CodeForces - 441B -Valera and Fruits
- CF———— Valera and Contest
- Codeforces #252 (Div. 2) B. Valera and Fruits
- Codeforces Round #252 (Div. 2) 441B. Valera and Fruits
- Codeforces Round #252 (Div. 2)B. Valera and Fruits
- 九六七八은 生命의 呼吸
- memcpy和memmove的区别
- Ios 程序打包,安装流程
- Qt QDateTime QTimer的简单实用
- 图像处理-线性滤波-3 高斯滤波器
- B. Valera and Contest
- 如何制作一个横版格斗过关游戏 Cocos2d-x 2.0.4
- Linux下驱动开发之二(LED驱动)-------Tiny6410
- 利用while循环
- Linux shell用法和技巧
- java连接oracle数据库 -- Jdbc—odbc的桥连接方式
- IOS7新特性
- 3g modem模式切换
- 为什么要使用SLF4J而不是Log4J