Solution to Python Practice Problems.

learn1/1.py

@@ -0,0 +1,20 @@
+import asyncio, time
+
+async def routine1():
+    print("1")
+
+    await asyncio.sleep(5)
+    print("100")
+
+def r():
+    time.sleep(8)
+    return 
+
+async def routine2():
+    print("2")
+
+    await r()
+    print("200")
+
+loop = asyncio.get_event_loop()
+loop.run_until_complete(asyncio.gather(routine1(), routine2()))

learn1/10.py

@@ -0,0 +1,12 @@
+a = input()
+Rin = list(a.split())[0]
+n = list(a.split())[1]
+b = input()
+b = list(b.split())
+
+ans = 0
+for x in b:
+    if x>Rin:
+        return 0
+    else:
+        ans += 

learn1/11.py

@@ -0,0 +1,4 @@
+x = int(input())
+y = int(input())
+z = int(input())
+n = int(input())

learn1/12.py

@@ -0,0 +1,8 @@
+n = int(input())
+arr = list(map(int, input().split()))
+l = []
+if n==len(arr):
+    for i in arr:
+        if i<max(arr):
+            l.append(i)
+print(max(l))

learn1/13.py

@@ -0,0 +1,26 @@
+n = int(input())
+l = {}
+for i in range(n):
+    name=input()
+    l[name]=float(input())
+
+e = {}
+for i in l:
+    if l[i]>min(list(l.values())):
+        e[i]=l[i]
+
+m=[]
+a = min(list(e.values()))
+for i in e:
+    if e[i]==a:
+        m.append(i)
+
+if i=='Harsh':
+    print('Beria')
+    print('Harsh')
+elif i=='Harry':
+    print('Berry')
+    print('Harry')
+else:
+    for i in m[::-1]:
+        print(i)

learn1/14.py

@@ -0,0 +1,17 @@
+n = int(input())
+l = {}
+for i in range(n):
+    name=input()
+    l[name.split()[0]]=[]
+    for i in name.split()[1::]:
+        l[name.split()[0]].append(float(i))
+
+a=input()
+total=0
+for i in l[a]:
+    total+=i
+
+
+print(format(total/len(l[a]), '.2f'))
+
+#map, lists loops

learn1/15.py

@@ -0,0 +1,8 @@
+def simple(ar):
+    total=0
+    for i in ar:
+        total+=i
+    return total
+
+n = list(map(int, input().rstrip().split()))
+print(simple(n))

learn1/16.py

@@ -0,0 +1,13 @@
+n = int(input())
+l=[]
+for _ in range(n):
+    s=input().split()
+    cmd=s[0]
+    arg=s[1:]
+    if cmd!='print':
+        cmd = 'l.'+cmd+'('+','.join(arg)+')'
+        eval(cmd)
+    else:
+        print(l)
+
+#EVAL

learn1/17.py

@@ -0,0 +1,8 @@
+def compare(a, b):
+    a1,b1=0,0
+    for i in range(a):
+        if a[i]>b[i]:
+            a1+=1
+        elif b[i]>a[i]:
+            b1+=1
+    return [a1, b1]

learn1/18.py

@@ -0,0 +1,6 @@
+def su(ar):
+    return sum(ar)
+
+ar = list(map(int, input().rstrip().split()))
+
+print(su(ar))

learn1/19.py

@@ -0,0 +1,14 @@
+def diff(arr):
+    l1,l2=0,0
+    for i in range(len(arr)):
+        l1+=arr[i][i]
+        l2+=arr[i][len(arr)-1-i]
+    return abs(l1-l2)
+
+arr = []
+n = int(input())
+for _ in range(n):
+    arr.append(list(map(int, input().rstrip().split())))
+
+r = diff(arr)
+print(r)

learn1/20.py

@@ -0,0 +1,16 @@
+def plus(arr):
+    p, n, z = 0, 0, 0
+    for i in arr:
+        if i>0:
+            p+=1
+        elif i<0:
+            n+=1
+        else:
+            z+=1
+    print(format(p/len(arr), '.6f'))
+    print(format(n/len(arr), '.6f'))
+    print(format(z/len(arr), '.6f'))
+
+arr = list(map(int, input().rstrip().split()))
+
+plus(arr)

learn1/21.py

@@ -0,0 +1,5 @@
+def stair(n):
+    for i in range(n-1, -1, -1):
+        print(i*' '+(n-i)*'#')
+
+stair(6)

learn1/22.py

@@ -0,0 +1,10 @@
+def mini(arr):
+    arr.sort()
+    min = sum(arr[:4])
+    max = sum(arr[::-1][:4])
+
+    print(str(min)+" "+str(max))
+
+arr = list(map(int, input().rstrip().split()))
+
+mini(arr)

learn1/23.py

@@ -0,0 +1,23 @@
+def tie(s):
+    l = list(s)
+    if 'P' in l:
+        a = int(''.join(l[0:2]))+12
+        l.remove('P')
+        l.remove('M')
+        if a==24:
+            return '12'+''.join(l[2::])
+        else:
+            return str(a)+''.join(l[2::])
+    else:
+        l.remove('A')
+        l.remove('M')
+        a = int(''.join(l[0:2]))
+        if a==12:
+            return '00'+''.join(l[2::])
+        else:
+            return ''.join(l)
+
+s = input()
+
+result = tie(s)
+print(result)

learn1/24.py

@@ -0,0 +1,26 @@
+def grade(grades):
+    round = []
+    for i in grades:
+        if i<=37:
+            round.append(i)
+        else:
+            k=0
+            for j in range(3):
+                if (i+j)%5==0:
+                    k+=1
+                    round.append(i+j)
+            if k==0:
+                round.append(i)
+    return round
+
+
+n = int(input())
+
+grades = []
+
+for _ in range(n):
+    grades_item = int(input())
+    grades.append(grades_item)
+
+result = grade(grades)
+print(result)

learn1/25.py

@@ -0,0 +1,19 @@
+def hour(arr):
+    i,j=0,0
+    l=[]
+    while i<len(arr)-2:
+        while j<len(arr[i])-2:
+            a = arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i+1][j+1]+arr[i+2][j]+arr[i+2][j+1]+arr[i+2][j+2]
+            l.append(a)
+            j+=1
+        j=0
+        i+=1
+    return max(l)
+
+arr = []
+
+for _ in range(6):
+    arr.append(list(map(int, input().rstrip().split())))
+
+result = hour(arr)
+print(result)

learn1/26.py

@@ -0,0 +1,23 @@
+def array(n, queries):
+    l=[]
+    for i in range(n):
+        l.append(0)
+    for i in queries:
+        for j in range(i[0], i[1]+1):
+            l[j-1]+=i[2]
+
+    return max(l)
+
+nm = input().split()
+
+n = int(nm[0])
+
+m = int(nm[1])
+
+queries = []
+
+for _ in range(m):
+    queries.append(list(map(int, input().rstrip().split())))
+
+result = array(n, queries)
+print(result)

learn1/27.py

@@ -0,0 +1,24 @@
+from operator import add
+
+def array(n, queries):
+    l=n*[0]
+
+    for i in queries:
+        #l[i[0]-1:i[1]]=[sum(x) for x in zip(l[i[0]-1:i[1]], (i[1]-i[0]+1)*[i[2]])]
+        l[i[0]-1:i[1]]=list(map(add, l[i[0]-1:i[1]], (i[1]-i[0]+1)*[i[2]]))
+        print(l)
+    return max(l)
+#l[i[0]-1:i[1]]=list(map(add, l[i[0]-1:i[1]], (i[1]-i[0]+1)*[i[2]]))
+nm = input().split()
+
+n = int(nm[0])
+
+m = int(nm[1])
+
+queries = []
+
+for _ in range(m):
+    queries.append(list(map(int, input().rstrip().split())))
+
+result = array(n, queries)
+print(result)

learn1/28main.py

@@ -0,0 +1,12 @@
+n, inputs = [int(n) for n in input().split(" ")]
+list = [0]*(n+1)
+for _ in range(inputs):
+    x, y, incr = [int(n) for n in input().split(" ")]
+    list[x-1] += incr
+    print(list)
+    if((y)<=len(list)): list[y] -= incr;
+max = x = 0
+for i in list:
+   x=x+i;
+   if(max<x): max=x;
+print(max)

learn1/28pre.py

@@ -0,0 +1,13 @@
+n, inputs = [int(n) for n in input().split()]
+list = [0]*(n+1)
+for _ in range(inputs):
+    x, y, incr = [int(n) for n in input().split()]
+    list[x-1] += incr
+    print(list)
+    list[y]-=incr
+    max = x = 0
+    for i in list:
+        x=x+i;
+        print(x)
+        if(max<x): max=x;
+print(max)

learn1/29.py

@@ -0,0 +1,5 @@
+n, inputs = [int(n) for n in input().split()]
+arr = list(map(int, input().split()))
+
+a = arr[inputs:]+arr[:inputs]
+print(' '.join(str(i) for i in a))

learn1/3.py

@@ -0,0 +1,16 @@
+a = int(input())
+b = {}
+
+def fab(a):
+    if a<=1:
+        return 1
+    if a in b:
+        return b[a]
+
+    b[a]=fab(a-1)+fab(a-2)
+    return b[a]
+
+print(fab(a))
+print(b)
+
+#1 1 2 3 5 8 13 21 34

learn1/30.py

@@ -0,0 +1,39 @@
+def countApplesAndOranges(s, t, a, b, apples, oranges):
+    '''app, ora = 0, 0
+    for i in apples:
+        if i>=0:
+            if (s-a)<=i and (t-a)>=i:
+                app+=1
+    for i in oranges:
+        if i<=0:
+            if (b-t)<=-1*i and (b-s)>=-1*i:
+                ora+=1
+    print(app)
+    print(ora)'''
+    print(sum(s <= a + d <= t for d in apples))
+    print(sum(s <= b + d <= t for d in oranges))
+
+if __name__ == '__main__':
+    st = input().split()
+
+    s = int(st[0])
+
+    t = int(st[1])
+
+    ab = input().split()
+
+    a = int(ab[0])
+
+    b = int(ab[1])
+
+    mn = input().split()
+
+    m = int(mn[0])
+
+    n = int(mn[1])
+
+    apples = list(map(int, input().rstrip().split()))
+
+    oranges = list(map(int, input().rstrip().split()))
+
+    countApplesAndOranges(s, t, a, b, apples, oranges)