-
Notifications
You must be signed in to change notification settings - Fork 1
/
Elite Day-7 Program-1.txt
71 lines (59 loc) · 1.42 KB
/
Elite Day-7 Program-1.txt
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
There is a board with M*N size.
The board contains M*N blocks of 1*1 size.
Each block is printed a number on it.
You will be given a number, your task is to find whether the number is printed on
any of the blocks or not. If found print true, otherwise print false.
NOTE:
- The numbers printed on the board in each row and each column are
in increasing order. And all the numbers are unique.
Input Format:
-------------
Line-1 -> Two integers M and N, board size.
Next M lines -> N space separated integers.
Last Line -> An integer T, number to search.
Output Format:
--------------
Print a boolean value, 'true' if number found.
otherwise, 'false'.
Sample Input-1:
---------------
4 4
1 3 6 10
2 5 9 13
4 8 12 16
7 11 14 17
5
Sample Output-1:
----------------
true
Sample Input-2:
---------------
4 4
1 3 6 10
2 5 9 13
4 8 12 16
7 11 14 17
15
Sample Output-2:
----------------
false
import sys
r,c=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(r)]
ele=int(input())
i=0
while(i<r):
if l[i][0]<=ele<=l[i][-1]:
c_s,c_e=0,c-1
while(c_s<=c_e):
c_mid=(c_s+c_e)//2
if l[i][c_mid]==ele:
print(True)
sys.exit()
if l[i][c_mid]<ele:
c_s=c_mid+1
if l[i][c_mid]>ele:
c_e=c_mid-1
i+=1
else:
print(False)