added assignments

Author: g147

APlusB.py

@@ -0,0 +1,9 @@
+# python3
+
+
+def sum_of_two_digits(first_digit, second_digit):
+ return first_digit + second_digit
+
+if __name__ == '__main__':
+ a, b = map(int, input().split())
+ print(sum_of_two_digits(a, b))

fibonacci.py

@@ -0,0 +1,14 @@
+# Uses python3
+fibs={
+ 0:0,
+ 1:1
+}
+def calc_fib(n):
+ if n in fibs:
+ return fibs.get(n)
+ else:
+ fibs.update({n:calc_fib(n-1) + calc_fib(n-2)})
+ return fibs.get(n)
+
+n = int(input())
+print(calc_fib(n))

fibonacci_huge.py

@@ -0,0 +1,24 @@
+# Uses python3
+
+def pisanoPeriod(m): 
+ previous, current = 0, 1
+ for i in range(0, m * m): 
+ previous, current = current, (previous + current) % m 
+ if (previous == 0 and current == 1): 
+ return i + 1
+
+def get_fibonacci_huge_naive(n, m):
+ pisano_period = pisanoPeriod(m) 
+ n = n % pisano_period 
+ previous, current = 0, 1
+ if n==0: 
+ return 0
+ elif n==1: 
+ return 1
+ for i in range(n-1): 
+ previous, current = current, previous + current 
+ return (current % m) 
+
+if __name__ == '__main__':
+ n, m = map(int, input().split())
+ print(get_fibonacci_huge_naive(n, m))

fibonacci_last_digit.py

@@ -0,0 +1,16 @@
+# Uses python3
+fibs={
+ 0:0,
+ 1:1
+}
+def get_fibonacci_last_digit_naive(n):
+ if n in fibs:
+ return fibs.get(n)
+ for i in range(2,n+1):
+ fibs.update({i: (fibs.get(i-1)+fibs.get(i-2))%10})
+ return fibs.get(n)
+
+if __name__ == '__main__':
+ n = int(input())
+ print(get_fibonacci_last_digit_naive(n))
+

fibonacci_sum_last_digit.py

@@ -0,0 +1,20 @@
+# Uses python3
+# Uses python3
+fibs={
+ 0:0,
+ 1:1
+}
+
+def fibonacci_sum_naive(n):
+ if n in fibs:
+ return fibs.get(n)
+ n=(n+2)%60
+ for i in range(2,n+1):
+ fibs.update({i: (fibs.get(i-1)%10+fibs.get(i-2)%10)%10})
+ if(fibs.get(n) == 0):
+ return 9
+ return (fibs.get(n) % 10) - 1
+
+if __name__ == '__main__':
+ n = int(input())
+ print(fibonacci_sum_naive(n))

gcd.py

@@ -0,0 +1,9 @@
+# Uses python3
+def gcd_naive(a, b):
+ if(b==0):
+ return a
+ return gcd_naive(b,a%b)
+
+if __name__ == "__main__":
+ a, b = map(int, input().split())
+ print(gcd_naive(a, b))

lcm.py

@@ -0,0 +1,13 @@
+# Uses python3
+def gcd_naive(a, b):
+ if(b==0):
+ return a
+ return gcd_naive(b,a%b)
+
+def lcm_naive(a, b):
+ return int((max(a,b)/gcd_naive(a,b))*min(a,b))
+
+if __name__ == '__main__':
+ a, b = map(int, input().split())
+ print(lcm_naive(a, b))
+

max_pairwise_product.py

@@ -0,0 +1,12 @@
+# python3
+
+
+def max_pairwise_product(numbers):
+ numbers.sort(reverse=True)
+ return (numbers[0]*numbers[1])
+
+
+if __name__ == '__main__':
+ input_n = int(input())
+ input_numbers = [int(x) for x in input().split()]
+ print(max_pairwise_product(input_numbers))