Codeforces 432 A. Choosing Teams
来源:互联网 发布:手机怎么发布淘宝宝贝 编辑:程序博客网 时间:2024/06/11 04:51
题目:http://codeforces.com/contest/432/problem/A
题意:一个人一辈子最多能参加5次比赛,现在有N个人,给出每个人已经参加过的比赛的次数,现在要让他们进行组队,每队必须三个人,问最多能组成多少队,使得每个队伍在成员不改变的情况下,最多参加k次比赛。
其实就是找出N个人里面还能再参加K次比赛的人,让这些人组队就可以了。
#include<cstdio>int n, k, a, s;int main(){ while(~scanf("%d %d", &n, &k)){ s=0; while(n--){ scanf("%d", &a); if(a+k<=5) s++; } printf("%d\n", s/3); } return 0;}
0 0
- Codeforces 432A Choosing Teams
- Codeforces 432 A. Choosing Teams
- Codeforces 432A Choosing Teams
- Codeforces 432A Choosing Teams(水题)
- codeforces——432A—— Choosing Teams
- Codeforces #246 (Div. 2) A. Choosing Teams
- Codeforces #246 (Div. 2) A. Choosing Teams
- A. Choosing Teams
- Codeforces Round #246 (Div. 2) - A. Choosing Teams
- Codeforces Round #246 (Div. 2) A. Choosing Teams
- Codeforces Round #246 (Div. 2):A. Choosing Teams
- Codeforces Round #246 (Div. 2) A. Choosing Teams
- CF 246 A Choosing Teams
- Choosing Teams
- Choosing Teams
- codeforces 899A Splitting in Teams题解
- 【CODEFORCES】 B. Random Teams
- codeforces D.Teams Formation
- Python 3.4.0 正式版发布
- php 实现二进制加法运算
- Binary Tree Maximum Path Sum :from LeetCode
- Codeforces #246 (Div. 2) B. Football Kit
- AIR Debug Launcher (ADL)
- Codeforces 432 A. Choosing Teams
- send xml request
- 约数是怎么形成的
- 硬盘文件不见了还能恢复吗
- 自举就是正反馈
- 捕鱼问题的java实现
- 时间函数的声明。
- SPI总线协议介绍
- HTTP Header 详解