Update 002. Apple and Orange.py

Algorithms/02. Implementation/002. Apple and Orange.py

@@ -1,9 +1,29 @@
 # Problem: https://www.hackerrank.com/challenges/apple-and-orange/problem
 # Score: 10
 
+# Read input values
+s, t = map(int, input().split())  # House start and end point
+a, b = map(int, input().split())  # Apple tree and orange tree position
+m, n = map(int, input().split())  # Number of apples and oranges
 
-s, t, a, b, m, n = map(int, input().split() + input().split() + input().split())
-apple = list(map(int, input().split()))
-orange = list(map(int, input().split()))
-print(sum(s <= a + i <= t for i in apple))
-print(sum(s <= b + i <= t for i in orange))
+# Distances apples fell from the apple tree
+apples = list(map(int, input().split()))
+
+# Distances oranges fell from the orange tree
+oranges = list(map(int, input().split()))
+
+# Count how many apples fell on the house
+apple_count = 0
+for d in apples:
+    if s <= a + d <= t:  # Final position of apple is within house range
+        apple_count += 1
+
+# Count how many oranges fell on the house
+orange_count = 0
+for d in oranges:
+    if s <= b + d <= t:  # Final position of orange is within house range
+        orange_count += 1
+
+# Print the results
+print(apple_count)
+print(orange_count)