Codeforces Round #216 (Div. 2)
来源:互联网 发布:mac网页怎么添加收藏 编辑:程序博客网 时间:2024/06/06 00:57
A
#include<iostream>#using namespace std;int main(){ int n,m,k,l1=0,l2=0,sum=0; cin>>n>>m>>k; while(n--) { int a; cin>>a; if(a==1) m--; if(a==2) {if(k>0) k--;else m--;} } if(m<0&&k<0) cout<<-m-k<<endl; else if(k<0) cout<<-k<<endl; else if(m<0) cout<<-m<<endl; else cout<<0<<endl; return 0;}
B 我写错了,只有别人的代码。这个方法真的很不错。
Valera loves to participate in competitions. Especially in programming contests. Today he has participated in the contest with his team, consisting ofn 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 exactlysall points;
- the total score of the k members of the team who scored the most points is equal to exactlysk; more formally, ifa1, a2, ..., an is the sequence of points earned by the team of students in the decreasing order(a1 ≥ a2 ≥ ... ≥ an), thensk = a1 + a2 + ... + ak.
However, Valera did not find out exactly how many points each ofn 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 integersn, 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 integersa1, 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>using namespace std;int main(){ int n,k,l,r,sall,sk; cin>>n>>k>>l>>r>>sall>>sk; n=n-k,sall=sall-sk; while(k>0) { cout<<sk/k<<" "; sk=sk-sk/k; k--; } while(n>0) { cout<<sall/n<<" "; sall=sall-sall/n; n--; } return 0;}
- Codeforces Round #216 (Div. 2)
- Codeforces Round #216 (Div. 2)
- Codeforces Round #216 (Div. 2)
- Codeforces Round #216 (Div. 2)
- Codeforces Round #216 (Div. 2)
- Codeforces Round #216 (Div. 2) A.B
- Codeforces Round #216 (Div. 2)部分题解
- Codeforces Round #216 (Div. 2)(好)
- Codeforces Round #102 (Div. 2)
- Codeforces Round #103 (Div. 2)
- Codeforces Round #103 (Div. 2)
- Codeforces Round #104 (Div. 2)
- Codeforces Round #105 (Div. 2)
- Codeforces Round #105 (Div. 2)
- Codeforces Round #107 (Div. 2)
- Codeforces Round #108 (Div. 2)
- Codeforces Round #110 (Div. 2)
- Codeforces Round #122 (Div. 2)
- python re(十二)
- 黑客是怎样炼成的<2> 黑客常用工具及软件
- 生理周期 (每个人都有的)
- PETSC TS 测试
- hdu 2159
- Codeforces Round #216 (Div. 2)
- 【目录】贴吧目录
- Sorting_Searching 叠罗汉 @CareerCup
- 百炼POJ 1657 Distance on Chessboard 解题报告
- 百炼POJ 2808 校门外的树
- Codeforces Round #216 (Div. 2)
- 高通msm8x60芯片 2.6内核编译CM10.1的尝试(尚未完成)
- Spring 事务研磨
- Install MySQL Workbench in Ubuntu 12.10 or 12.04