-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbitwiseAnd.py
51 lines (39 loc) · 944 Bytes
/
bitwiseAnd.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#!/bin/python3
import math
import os
import random
import re
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'bitwiseAnd' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER N
# 2. INTEGER K
#
def bitwiseAnd(N, K):
maximum = 0
for i in range(1, N+1):
for j in range(1,i):
h = i & j
if maximum < h < K:
maximum = h
if maximum == K-1:
return maximum
return maximum
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
t = int(input().strip())
for t_itr in range(t):
first_multiple_input = input().rstrip().split()
count = int(first_multiple_input[0])
lim = int(first_multiple_input[1])
res = bitwiseAnd(count, lim)
fptr.write(str(res) + '\n')
fptr.close()