A11146 | Round Subset
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
输入格式
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 $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=10^{18}$ ).
The second line contains $n$ space-separated integer numbers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=10^{18}$ ).
输出格式
Print maximal roundness of product of the chosen subset of length $k$ .
输入输出样例
输入 #1
3 2 50 4 20
输出 #1
3
输入 #2
5 3 15 16 3 25 9
输出 #2
3
输入 #3
3 3 9 77 13
输出 #3
0
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.
In the second example subset $[15,16,25]$ has product 6000, roundness 3.
In the third example all subsets has product with roundness 0.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted