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
这道题的意思是，输出n,m,n 代表座位的情况，m代表他的盆友，所以要求他们能不能坐在一起看电影就要有M+1个空位，也就是m+1 个0连在一起才行啦
#include <iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define N 100010
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m,sum=0;
cin>>n>>m;
char s[N];
getchar();
scanf("%s",s);
int len=strlen(s);
int glas=0;
for(int i=0; i<len; i++)
{
if(s[i]=='0')
{
sum++;
}
else sum=0;
if(sum==m+1)
{
glas=1;
break;
}
}
if(glas)cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
return 0;
}