秋招模拟赛第33场(会员专属)|2023.07.07-oppo提前批
- Status
- Done
- Rule
- IOI
- Problem
- 3
- Start at
- 2023-7-15 19:00
- End at
- 2023-7-15 20:30
- Duration
- 1.5 hour(s)
- Host
- Partic.
- 23
You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.
K0序列是指,序列中元素的乘积转换为2进制后末尾至少有 k 个0。
给定一个长度为 n 的序列 a 和 k 值,求其中为K0序列的连续子序列的最小长度。
输入第一行两个正整数 n,k 。(3≤n≤105,1≤k≤105)
输入第二行 n 个正整数,第 i个为 ai 。(1≤ai≤109)
输出一个正整数 ,表示连续子序列的二进制不小于 k 的长度。
样例输入
7 3
1 2 3 4 5 6 7
样例输出
3
扫码备注加群即可,期待您的到来~
By signing up a CodeFun2000 universal account, you can submit code and join discussions in all online judging services provided by us.