update solutions

Author: ck-unifr

implementation/apple-and-orange.py

@@ -0,0 +1,39 @@
+#https://www.hackerrank.com/challenges/apple-and-orange/problem
+
+#!/bin/python3
+
+import os
+import sys
+
+#
+# Complete the countApplesAndOranges function below.
+#
+def countApplesAndOranges(s, t, a, b, apples, oranges):
+ 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])
+
+ apple = list(map(int, input().rstrip().split()))
+
+ orange = list(map(int, input().rstrip().split()))
+
+ countApplesAndOranges(s, t, a, b, apple, orange)

warmup/a-very-big-sum.py

@@ -0,0 +1,28 @@
+# https://www.hackerrank.com/challenges/a-very-big-sum/problem
+
+#!/bin/python3
+
+import os
+import sys
+
+#
+# Complete the aVeryBigSum function below.
+#
+def aVeryBigSum(n, ar):
+ sum = 0
+ for i in range(n):
+ sum = sum + ar[i]
+ return sum
+
+if __name__ == '__main__':
+ f = open(os.environ['OUTPUT_PATH'], 'w')
+
+ n = int(input())
+
+ ar = list(map(int, input().rstrip().split()))
+
+ result = aVeryBigSum(n, ar)
+
+ f.write(str(result) + '\n')
+
+ f.close()