k=int(raw_input('Enter the binary number:'))
b=k
c=0
while b>0:
b=b/10
c=c+1
print c
n=0
sum=0
while n<c:
r=k%10
k=k/10
sum=sum + (r*(2**n))
n=n+1
print 'Decimal Number is:', sum
Solve Problems by Coding Solutions - A Complete solution for python programming
Showing posts with label Integer. Show all posts
Showing posts with label Integer. Show all posts
Simple calculator using if elseif else and nested if else
a=int(raw_input('Enter the value of a:'))
b=int(raw_input('Enter the value of b:'))
print ' 1. add 2.sub 3.mul 4. div 5.exp'
n=int(raw_input('Enter the choice:'))
if n==1:
c=a+b
print 'Added value is:',c
elif n==2:
if a>b: #Nested if else
c=a-b
print 'Subtracted value is:',c
else:
c=b-a
print 'Subtracted value is:',c
elif n==3:
c=a*b
print 'Multiplication value is:',c
elif n==4:
if b==0: #Nested if else
print 'Division by zero not defined'
else:
c=float(a)/b
print 'Divison value is:',c
elif n==5:
c=a**b
print 'Exponent value is:',c
else:
print 'Invalid options'
b=int(raw_input('Enter the value of b:'))
print ' 1. add 2.sub 3.mul 4. div 5.exp'
n=int(raw_input('Enter the choice:'))
if n==1:
c=a+b
print 'Added value is:',c
elif n==2:
if a>b: #Nested if else
c=a-b
print 'Subtracted value is:',c
else:
c=b-a
print 'Subtracted value is:',c
elif n==3:
c=a*b
print 'Multiplication value is:',c
elif n==4:
if b==0: #Nested if else
print 'Division by zero not defined'
else:
c=float(a)/b
print 'Divison value is:',c
elif n==5:
c=a**b
print 'Exponent value is:',c
else:
print 'Invalid options'
To check the number is Prime or Not
n=int(raw_input('Enter the number to check:'))
flag=0
i=2
while(i<=(n/2)):
if (n%i==0):
flag=1
i=i+1
if(flag==0):
print 'The number ',n, ' is prime number'
else:
print 'The number ',n, ' is not prime number'
flag=0
i=2
while(i<=(n/2)):
if (n%i==0):
flag=1
i=i+1
if(flag==0):
print 'The number ',n, ' is prime number'
else:
print 'The number ',n, ' is not prime number'
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'
Subscribe to:
Posts (Atom)