y=[]
n=int(raw_input('Enter the no of elements added to list:'))
index=0
for i in range(n):
element=int(raw_input('Enter the elements:'))
y.insert(index, element)
index=index+1
print y
Solve Problems by Coding Solutions - A Complete solution for python programming
To add elements inside a list using append
l=[]
n=int(raw_input('Enter the no of elements added to list:'))
for i in range(n):
element=int(raw_input('Enter the elements:'))
l.append(element)
print l
n=int(raw_input('Enter the no of elements added to list:'))
for i in range(n):
element=int(raw_input('Enter the elements:'))
l.append(element)
print l
To count the elements in a nested list with all elements are list
a=[[3, 4, 5,8, 8 ], [5, 6, 7], [7, 8, 9]]
def count(a):
j=0
n=0
for b in a:
j=len(b)
n=n+j
return n
t= count(a)
print "No elements in the nested list are:",t
def count(a):
j=0
n=0
for b in a:
j=len(b)
n=n+j
return n
t= count(a)
print "No elements in the nested list are:",t
Count of character repetition in a string
word=str(raw_input('Enter the string:'))
n=raw_input('Enter the character to search in string:')
c=0
for i in word:
if i==n:
c=c+1
print 'Number of times the character repeated is', c
n=raw_input('Enter the character to search in string:')
c=0
for i in word:
if i==n:
c=c+1
print 'Number of times the character repeated is', c
To check a string is palidrome or not
k=raw_input('Enter a string: ')
if k==k[::-1]:
print 'String is palidrome'
else:
print 'String is not palidrome'
if k==k[::-1]:
print 'String is palidrome'
else:
print 'String is not palidrome'
Find the Armstrong Number upto a number
# Compatible in Python 2.7
k=int(raw_input('Enter the range of number:'))
for n in range(k):
sum=0
temp=n
y=len(str(n))
while(n>0):
R=n%10
V=R**y
sum=sum+V
n=n/10
if (sum==temp):
print 'Armstrong Number',temp
k=int(raw_input('Enter the range of number:'))
for n in range(k):
sum=0
temp=n
y=len(str(n))
while(n>0):
R=n%10
V=R**y
sum=sum+V
n=n/10
if (sum==temp):
print 'Armstrong Number',temp
Fibonacci sequence using functions for N numbers
# Compatible in Python 2.7
def recur_fibo(n):
if n <= 1:
return n
else:
return(recur_fibo(n-1) + recur_fibo(n-2))
nterms = int(input("How many terms? "))
if nterms <= 0:
print "Plese enter a positive integer"
else:
print "Fibonacci sequence:"
for i in range(nterms):
print recur_fibo(i)
Multiplication Table
# Compatible in Python 2.7
num = int(raw_input("Display multiplication table of? "))
for i in range(1, 21):
print num,'x',i,'=',num*i
num = int(raw_input("Display multiplication table of? "))
for i in range(1, 21):
print num,'x',i,'=',num*i
Program to check the number is palindrome
# Compatible in Python 2.7
Number = int(raw_input("Please Enter any Number: "))
Temp=Number # Number is stored to a temporary variable
Reverse = 0 # Initialize the reverse value to overcome garbage value storage
if Number<0:
print 'Number is negative'
elif Number ==0:
print 'Reverse Number is',Number
elif Number>0:
while(Number > 0):
Reminder = Number %10
Reverse = (Reverse *10) + Reminder
Number = Number /10
print 'Reverse of a Number is',Reverse
else:
exit()
if Temp==Reverse:
print 'The number is palidrome'
else:
print 'The number is not palidrome'
Number = int(raw_input("Please Enter any Number: "))
Temp=Number # Number is stored to a temporary variable
Reverse = 0 # Initialize the reverse value to overcome garbage value storage
if Number<0:
print 'Number is negative'
elif Number ==0:
print 'Reverse Number is',Number
elif Number>0:
while(Number > 0):
Reminder = Number %10
Reverse = (Reverse *10) + Reminder
Number = Number /10
print 'Reverse of a Number is',Reverse
else:
exit()
if Temp==Reverse:
print 'The number is palidrome'
else:
print 'The number is not palidrome'
Python Coding Sites
Try Python http://campus.codeschool.com/courses/try-python/contents
Python Codecademy https://www.codecademy.com/learn/python
Learn Python http://www.learnpython.org/
Python Codecademy https://www.codecademy.com/learn/python
Learn Python http://www.learnpython.org/
Subscribe to:
Posts (Atom)