Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit dcefd3a

Browse files
Adding 13 solutions
1 parent 04c8f34 commit dcefd3a

File tree

13 files changed

+211
-0
lines changed

13 files changed

+211
-0
lines changed
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
arr = []
2+
n = int(input("Enter the number of Elements: "))
3+
4+
for i in range(0,n):
5+
ele = int(input("Enter Element: "))
6+
arr.append(ele)
7+
8+
max = arr[0]
9+
min = arr[0]
10+
11+
for i in range(0,n):
12+
if arr[i] > max:
13+
max = arr[i]
14+
if arr[i] < min:
15+
min = arr[i]
16+
17+
print("Largest Element in this Array is: ", max)
18+
print("Smallest Element in this Array is: ", min)
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
arr = []
2+
n = int(input("Enter the number of Elements: "))
3+
4+
for i in range(0,n):
5+
ele = int(input("Enter Element: "))
6+
arr.append(ele)
7+
8+
print("Before Sorting: ")
9+
print(arr)
10+
print("After Sorting[increasing order]: ")
11+
arr.sort()
12+
print(arr)
13+
print("After Sorting[decreasing order]: ")
14+
arr.sort(reverse=True)
15+
print(arr)
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
arr = []
2+
n = int(input("Enter the number of Elements: "))
3+
4+
for i in range(0,n):
5+
ele = int(input("Enter Element: "))
6+
arr.append(ele)
7+
8+
sumOfArray = 0
9+
for i in range(0,n):
10+
sumOfArray += arr[i]
11+
12+
print("Sum of the Array: ", sumOfArray)
Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
lowerBound = int(input("Enter lower bound of the range: "))
2+
upperBound = int(input("Enter upper bound of the range: "))
3+
lstArmstrongNumbers = []
4+
lstNonArmstrongNumbers = []
5+
for number in range(lowerBound, upperBound+1):
6+
originalNumber = number
7+
numStr = str(number)
8+
exponent = len(numStr)
9+
sumofElements = 0
10+
for element in numStr:
11+
sumofElements = sumofElements + pow(int(element), exponent)
12+
if sumofElements == originalNumber and exponent > 1: # filtering the single-digit numbers
13+
lstArmstrongNumbers.append(number)
14+
print(f"Armstrong Numbers in the range between {lowerBound} and {upperBound} is: ", lstArmstrongNumbers)
Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,4 @@
1+
number = int(input("Enter the number: "))
2+
print(f"Multiplication Table of {number} is: ")
3+
for i in range(1, 11):
4+
print(f"{number} X {i} =", number*i)
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
import math
2+
def isPrime(number):
3+
if number<=1:
4+
return False
5+
for i in range(2, int(math.sqrt(number)+1)):
6+
if number % i == 0:
7+
return False
8+
return True
9+
10+
def primeinRanges(start, end):
11+
primes = []
12+
for i in range(start, end+1):
13+
if isPrime(i):
14+
primes.append(i)
15+
return primes
16+
17+
lowerBound = int(input("Enter lower bound of the range: "))
18+
upperBound = int(input("Enter upper bound of the range: "))
19+
print(primeinRanges(lowerBound, upperBound))
Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
number = int(input("Enter the number: "))
2+
perfectNumber = []
3+
for i in range(1, number):
4+
if number % i == 0:
5+
# print(i)
6+
perfectNumber.append(i)
7+
else:
8+
continue
9+
print(f"Perfect Numbers of {number} is:", perfectNumber)
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
def isEven(number):
2+
if number % 2 == 0:
3+
return True
4+
return False
5+
6+
def suminRange(start,end):
7+
sumofEvenNumbers = 0
8+
for i in range(start, end+1):
9+
if(isEven(i)):
10+
sumofEvenNumbers += i
11+
return sumofEvenNumbers
12+
13+
lowerBound = int(input("Enter lower bound of the range: "))
14+
upperBound = int(input("Enter upper bound of the range: "))
15+
print(suminRange(lowerBound,upperBound))
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
def isOdd(number):
2+
if number % 2 == 0:
3+
return False
4+
return True
5+
6+
def suminRange(start,end):
7+
sumofOddNumbers = 0
8+
for i in range(start, end+1):
9+
if(isOdd(i)):
10+
sumofOddNumbers += i
11+
return sumofOddNumbers
12+
13+
lowerBound = int(input("Enter lower bound of the range: "))
14+
upperBound = int(input("Enter upper bound of the range: "))
15+
print(suminRange(lowerBound,upperBound))
Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
limit = 100
2+
a,b = 0,1
3+
fibonacci_numbers = [a,b]
4+
for i in range(2,limit):
5+
c = a+b
6+
fibonacci_numbers.append(c)
7+
a, b = b, c
8+
position = int(input("Enter the position: "))
9+
print(fibonacci_numbers[position])

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /