跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0665. Round Subset

  • ID: 671
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 动态规划
  • 数学
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Round Subset

题目描述

D. Round Subset
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Let's call the roundness of the number the number of zeros to which it ends.

You have an array of n numbers. You need to choose a subset of exactly k numbers so that the roundness of the product of the selected numbers will be maximum possible.

Input

The first line contains two integer numbers n and k (1≤n≤200,1≤k≤n).

The second line contains n space-separated integer numbers a1,a2,...,an (1≤ai≤1018).

Output

Print maximal roundness of product of the chosen subset of length k.

Examples
Input
3 2
50 4 20
Output
3
Input
5 3
15 16 3 25 9
Output
3
Input
3 3
9 77 13
Output
0
Note

In the first example there are 3 subsets of 2 numbers. [50,4] has product 200 with roundness 2, [4,20] − product 80, roundness 1, [50,20] − product 1000, roundness 3.

In the second example subset [15,16,25] has product 6000, roundness 3.

In the third example all subsets has product with roundness 0.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 79 题。保留原作者与原赛事署名。