For this Question: An integer x is called suffix of integer y if binary form of x is suffix of binary form of y.
For example, 3 (binary = 11) is suffix of 7( binary = 111) and 11 ( binary = 1011).

You are given an integer array of size n and an Integer x. You have to count the number of integers y in the given array such that x is suffix of y.

<b>NOTE</b> : Leading zeroes are not considered in binary form for this problem .
For example : 5 in binary is 101 , not 0101 .First line contains n.
Second line contains n space separated.
Next line contains a single integer x.

<b> Constraints </b>
1 <= n <= 10<sup>5</sup>
1 <= arr[i], x = 10<sup>9</sup>A single integer denoting the required answer.Input:
5
11 13 3 9 7
3

Output:
3

Explanation :
11 => 1011
13 => 1101
3 => 11
9 => 1001
7 => 111

3 in binary form is "11". 3 is suffix of [ 11, 3, 7 ]., I have written this Solution Code: t= int(input())
arr = list(map(int, input().split()))
k = int(input())

k = bin(k)[2:][::-1]
count = 0

for i in range(len(arr)):
    l = bin(arr[i])[2:][::-1][0:len(k)]

    if l == k:
        count+=1

print(count), In this Programming Language: Python, Now tell me if this Code is compilable or not?