Python Code for Zero Count (TCS Codevita) | PrepInsta

November 28, 2023

Zero Count

TCS CodeVita is a coding competition organized by TCS every year, in search of world’s best coder. This is a global level coding competition in which coders from all around the world compete for the title of World’s Best Coder. Zero Count is one of the sample problem of this year TCS CodeVita season 11 competition.

Question -:You are given a binary string B of length L which contains K ones and remaining zeros. You are required to place the K ones in the binary string in such a way that the longest consecutive zeros have the least length possible. Once such a binary string is constructed, you are required to print the length of the contiguous block of zeros, which has the largest length.

Constraints
0 <= K <= L

1 <= L <= 10^6

Input
Single line consisting of two space separated integers denoting L and K.

Output
Print a single integer denoting the length of the longest consecutive zeros as per the problem.

Time Limit (secs)
1

Examples

Example 1
Input
3 1
Output
1
Explanation
B is of length 3 and it has 1 one’s.
So the possible strings as per the problem are 010, 001, 100.
In the first case, the maximum length of consecutive zeros is 1 whereas in the other two cases it is 2. Hence the constructed binary string is 010 and the output is 1.

Example 2
Input
3 3
Output
0
Explanation
B is of length 3 and it has all three one’s. There is no block of zeros, hence the output is 0.

Python

Run

def zerocount(L, K):
    if K == 0:
        return L
    if K == L:
        return 0
    max_zeros = 0
    if K > 0:
        max_zeros = 1
    return max_zeros
def main():
    L, K = map(int, input().split())
    res = zerocount(L, K)
    print(res)
if __name__ == "__main__":
    main()