Rami and K of his friends are going to watch a movie tonight. There are only one row that contains some available seats, all other rows are taken. Given the description of this row, Rami wants to know if he can find consecutive seats available to sit with his friends.
Input
The first line of input contains a single integer T, the number of test cases.
The first line of each test case consists of two-separated integers C, K (1 ≤ C, K ≤ 105), the number of seats in the row and the number of friends going with Rami, respectively.
The second line contains a string of C digits, where 0 represents an empty seat, and 1 represents taken one.
Output
For each test case, print a single line with yes if Rami can find a place for him and his friends, otherwise print no.
Example
Input
2
5 2
10101
6 3
000011
Output
no
yes
https://cn.vjudge.net/problem/506294/origin[这里写链接内容]
(https://cn.vjudge.net/problem/506294/origin)
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main()
{
char s[100005];
int t;
scanf("%d",&t);
while(t--)
{
int n,k;
scanf("%d%d",&n,&k);
getchar();
scanf("%s",s);
int sum=1;
int maxx=0;
int len=strlen(s);
for(int i=1;i<len;i++)
{
if(s[i]=='0'&&s[i-1]=='0')
{
sum++;
if(sum>maxx)maxx=sum;
}
else
{
sum=1;
}
}
if(maxx>=k+1)printf("yes\n");
else printf("no\n");
}
return 0;
}