-
Notifications
You must be signed in to change notification settings - Fork 0
/
tutorial_intro.py
49 lines (36 loc) · 992 Bytes
/
tutorial_intro.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
#https://www.hackerrank.com/challenges/tutorial-intro/problem?isFullScreen=true
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'introTutorial' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER V
# 2. INTEGER_ARRAY arr
#
def introTutorial(V, arr):
# Write your code here
def binSearch(V, arr, l, h):
if l >= h:
return l
m = (l + h)//2
mid = arr[m]
if mid == V:
return m
if mid > V:
return binSearch(V, arr, l, m - 1)
return binSearch(V, arr, m + 1, h)
return binSearch(V, arr, 0, len(arr) - 1)
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
V = int(input().strip())
n = int(input().strip())
arr = list(map(int, input().rstrip().split()))
result = introTutorial(V, arr)
fptr.write(str(result) + '\n')
fptr.close()