For this Question: You are given a binary string of length N. Find the number of substrings of length K in which the number of zeroes are greater or equal to the number of ones.The first line of the input contains two integers N and K, the length of the binary string and the length of the substrings to test.
The second line of the input contains the binary string.

Constraints
1 <= K <= N <= 200000
Each character of the string is either 0 or 1.Output a single integer, the answer to the problem.Sample Input
5 3
01010

Sample Output
2

Explanation: The substrings of length 3 are "010", "101", "010". Of these, the first and the third ones satisfy the condition.

Sample Input
5 2
01010

Sample Output
4

Explanation: All the substrings of length 2 satisfy the condition., I have written this Solution Code: n,k=[int(x) for x in input().split()]
A=input()
z=0
o=0
for i in range(k):
	if(A[i]=='1'):
		o += 1
	else:
		z += 1
c=0
if(z>=o):
	c += 1
for i in range(k,n):
	if A[i]=='1':
		o +=1
	else:
		z +=1
	if A[i-k] =='1':
		o -= 1
	else:
		z -= 1
	if(z>=o):
		c +=1
print(c), In this Programming Language: Python, Now tell me if this Code is compilable or not?