-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathApple and Orange.py
49 lines (36 loc) · 970 Bytes
/
Apple and Orange.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
'''
Problem Statement: https://www.hackerrank.com/challenges/apple-and-orange/problem
@Coded by TSG,2020
'''
import math
import os
import random
import re
import sys
# Complete the countApplesAndOranges function below.
def countApplesAndOranges(s, t, a, b, apples, oranges):
acount = 0
bcount = 0
for i in range(len(apples)):
temp = a+apples[i]
if(temp in range(s,t+1)):
acount+=1
for i in range(len(oranges)):
temp = b+oranges[i]
if(temp in range(s,t+1)):
bcount+=1
print (acount)
print (bcount)
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)