Add files via upload

Author: thatsabhishek

Diff for: Milestone 2/Arrays & Lists/ArraySum.py

@@ -0,0 +1,11 @@
+# Given an array of length N, you need to find and print the sum of all elements of the array.
+# Input Format :
+# Line 1 : An Integer N i.e. size of array
+# Line 2 : N integers which are elements of the array, separated by spaces
+
+n=int(input())
+li=[int(x) for x in input().split()]
+sum=0
+for i in range(n):
+    sum+=li[i]
+print(sum)

Diff for: Milestone 2/Functions/CheckArmstrong.py

@@ -0,0 +1,22 @@
+# Write a Program to determine if the given number is Armstrong number or not. 
+# Print true if number is armstrong, otherwise print false.
+# An Armstrong number is a number (with digits n) such that 
+# the sum of its digits raised to nth power is equal to the number itself.
+# For example,
+# 371, as 3^3 + 7^3 + 1^3 = 371
+# 1634, as 1^4 + 6^4 + 3^4 + 4^4 = 1634
+
+num = int(input())
+sum = 0
+n = num
+a = len(str(num))
+
+while n != 0:
+    r = n % 10
+    sum = sum + r**a
+    n = n // 10
+
+if (sum == num):
+    print('true')
+else:
+    print('false')

Diff for: Milestone 2/Functions/FahrenheittoCelsiusFunction.py

@@ -0,0 +1,29 @@
+# Given three values - Start Fahrenheit Value (S), End Fahrenheit value (E) and Step Size (W), 
+# you need to convert all Fahrenheit values from Start to End at the gap of W, 
+# into their corresponding Celsius values and print the table.
+# Input Format : 3 integers - S, E and W respectively
+
+# Input :
+# 0 
+# 100 
+# 20
+# Output :
+# 0   -17
+# 20  -6
+# 40  4
+# 60  15
+# 80  26
+# 100 37
+
+def printTable(start,end,step):
+	while end >= start:
+		c = (5*(start-32))/9
+		d = int(c)   
+		print(start, d)
+		start+=step
+
+	   
+s = int(input())
+e = int(input())
+step = int(input())
+printTable(s,e,step)

Diff for: Milestone 2/Functions/FibonacciMember.py

@@ -0,0 +1,37 @@
+# Given a number N, figure out if it is a member of fibonacci series or not. 
+# Return true if the number is member of fibonacci series else false.
+# Fibonacci Series is defined by the recurrence
+#     F(n) = F(n-1) + F(n-2)
+# where F(0) = 0 and F(1) = 1
+
+# Input 1 : 5
+# Output 1 : true
+# Input 2 : 14
+# Output 2 : false    
+
+
+def checkMember(n):
+    sum = 0
+    a = 0
+    b = 1
+    N = n
+    while n!=0:
+        sum = a+b
+        a = b
+        b = sum
+        n=n-1
+        if sum == N:
+            return True
+        else:
+            continue
+    if sum == N:
+        return True
+    else:
+        return False
+
+
+n = int(input())
+if(checkMember(n)):
+    print("true")
+else:
+    print("false")

Diff for: Milestone 2/Functions/Palindromenumber.py

@@ -0,0 +1,22 @@
+# Write a program to determine if given number is palindrome or not. 
+# Print true if it is palindrome, false otherwise.
+# Palindrome are the numbers for which reverse is exactly same as the original one. For eg. 121
+# Input : 121
+# Output : true
+
+def checkPalindrome(num):
+	n = num
+	sum = 0
+	while(n != 0):
+		r = n % 10
+		sum = sum*10+r
+		n = n//10
+	return sum
+
+
+num = int(input())
+isPalindrome = checkPalindrome(num)
+if(isPalindrome == num):
+	print('true')
+else:
+	print('false')

Diff for: Milestone 2/Test1/GreatestCommonDivisor.py

@@ -0,0 +1,23 @@
+# You are given two numbers, ‘X’ and ‘Y’. 
+# Your task is to find the greatest common divisor of the given two numbers.
+# The Greatest Common Divisor of any two integers is the largest number that divides both integers.
+
+# Input :
+# 2
+# 20 15
+# 8 32
+# Output :
+# 5
+# 8
+
+def findGcd(x, y):
+    while y:
+        x, y = y, x % y
+    return x
+
+t=int(input())
+while t!=0:
+    x,y=input().split()
+    x,y=int(x),int(y)
+    print(findGcd(x,y))
+    t=t-1

Diff for: Milestone 2/Test1/NumberStarpattern1.py

@@ -0,0 +1,15 @@
+n = int(input())
+i = 1
+k = 1
+while i<= n:
+    j= n
+    while j>= 1:
+        if j==k:
+            print('*',end='')
+        else:
+            print(j,end='')
+        j=j-1
+    print()
+    i=i+1
+    k=k+1
+        

Diff for: Milestone 2/Test1/YetanotherPattern.py

@@ -0,0 +1,39 @@
+# Ninja was playing with her sister to solve a puzzle pattern. However, 
+# even after taking several hours, they could not solve the problem.
+# A value of N is given to them, and they are asked to solve the problem. 
+# Since they are stuck for a while, they ask you to solve the problem. 
+# Can you help solve this problem?
+
+# Input :
+# 2
+# 3
+# 2
+# Output :
+# ***
+#  **     
+#   *
+
+# **
+#  *    
+
+
+def ninjaPuzzle(n):
+    i=1
+    while i<=n:
+        sp=1
+        while sp<i:
+            print(' ',end='')
+            sp=sp+1
+        j=1
+        while j<=n-i+1:
+            print('*',end='')
+            j=j+1
+        print()
+        i=i+1
+    return 0
+
+t=int(input())
+while t !=0 :
+    n = int(input())
+    ninjaPuzzle(n)
+    t=t-1