An Uni has n students who are regular competitive programmers. According to the ACM ICPC rules, each person can participate in the regional championship at most 5 times. The head of the Uni ACM Chapter is recently gathering teams to participate in this championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times? The first line of input contains two integers, n and k. The next line contains n integers: y1, y2, ..., yn (0 ≤ yi ≤ 5), where yi shows the number of times the i-thperson participated in the ACM ICPC Regional . Write a python program that prints how many teams can be formed according to the above problem statement. Sample Input 1 52 04510 Sample Input 2 64 012345 Sample Input 3 65 000000 Sample Output 1 1 Sample Output 2 0 Sample Output 3 2
An Uni has n students who are regular competitive programmers. According to the ACM ICPC rules, each person can participate in the regional championship at most 5 times.
The head of the Uni ACM Chapter is recently gathering teams to participate in this championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times?
The first line of input contains two integers, n and k. The next line contains n integers: y1, y2, ..., yn (0 ≤ yi ≤ 5), where yi shows the number of times the i-thperson participated in the ACM ICPC Regional .
Write a python program that prints how many teams can be formed according to the above problem statement.
Sample Input 1
52 04510
Sample Input 2
64 012345
Sample Input 3
65 000000
Sample Output
1 1
Sample Output
2 0
Sample Output
3 2
Step by step
Solved in 3 steps with 5 images
