-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathApple and Orange.py
140 lines (77 loc) · 4.05 KB
/
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
# Sam's house has an apple tree and an orange tree that yield an abundance of fruit. In the diagram below, the red region denotes his house, where is the start point, and is the endpoint. The apple tree is to the left of his house, and the orange tree is to its right. You can assume the trees are located on a single point, where the apple tree is at point , and the orange tree is at point .
# Apple and orange(2).png
# When a fruit falls from its tree, it lands units of distance from its tree of origin along the -axis. A negative value of means the fruit fell units to the tree's left, and a positive value of means it falls units to the tree's right.
# Given the value of for apples and oranges, determine how many apples and oranges will fall on Sam's house (i.e., in the inclusive range )?
# For example, Sam's house is between and . The apple tree is located at and the orange at . There are apples and oranges. Apples are thrown units distance from , and units distance. Adding each apple distance to the position of the tree, they land at . Oranges land at . One apple and two oranges land in the inclusive range so we print
# 1
# 2
# Function Description
# Complete the countApplesAndOranges function in the editor below. It should print the number of apples and oranges that land on Sam's house, each on a separate line.
# countApplesAndOranges has the following parameter(s):
# s: integer, starting point of Sam's house location.
# t: integer, ending location of Sam's house location.
# a: integer, location of the Apple tree.
# b: integer, location of the Orange tree.
# apples: integer array, distances at which each apple falls from the tree.
# oranges: integer array, distances at which each orange falls from the tree.
# Input Format
# The first line contains two space-separated integers denoting the respective values of and .
# The second line contains two space-separated integers denoting the respective values of and .
# The third line contains two space-separated integers denoting the respective values of and .
# The fourth line contains space-separated integers denoting the respective distances that each apple falls from point .
# The fifth line contains space-separated integers denoting the respective distances that each orange falls from point .
# Constraints
# Output Format
# Print two integers on two different lines:
# The first integer: the number of apples that fall on Sam's house.
# The second integer: the number of oranges that fall on Sam's house.
# Sample Input 0
# 7 11
# 5 15
# 3 2
# -2 2 1
# 5 -6
# Sample Output 0
# 1
# 1
# Explanation 0
# The first apple falls at position .
# The second apple falls at position .
# The third apple falls at position .
# The first orange falls at position .
# The second orange falls at position .
# Only one fruit (the second apple) falls within the region between and , so we print as our first line of output.
# Only the second orange falls within the region between and , so we print as our second line of output.
#!/bin/python3
import math
import os
import random
import re
import sys
# Complete the countApplesAndOranges function below.
def countApplesAndOranges(s, t, a, b, apples, oranges):
counter1 = 0
counter2 = 0
for i in range(0,len(apples)):
apples[i] = apples[i]+a
if(apples[i]>=s and apples[i]<=t):
counter1 += 1
for i in range(0,len(oranges)):
oranges[i] = oranges[i]+b
if(oranges[i]>=s and oranges[i]<=t):
counter2 += 1
print(counter1)
print(counter2)
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)