Coding Maniac

19

  import math def primefactors(n):     while n % 2 = = 0 :        print ( 2 ),        n = n / 2         for i in range ( 3 , int (math.sqrt(n)) + 1 , 2 ):               while (n % i = = 0 ):           print (i)           n = n / i           if n > 2 :        print (n)   n = int ( input ( "Enter the number for calculating the prime factors :\n" )) primefactors(n)

def fact(n):     if n <= 1:         return 1     return n * fact(n-1) def findRank(s):     n = len(s)     rank = 1     for i in range(n):         count = 0         for j in range(i+1, n):             if s[i] > s[j]:                 count += 1         rank += count * fact(n-i-1)     return rank def main():     s = input("Enter String:")     print(findRank(s))     return 0 main()

  import math n = int ( input ( "Enter an integer: " ) ) for i in range ( 1 , n + 1 ) : if i == 1 : print ( "1 = 1" ) else : print ( i , "=" , end = ' ' ) c = 0 for j in range ( 1 , i + 1 ) : if i % j == 0 : c += 1 if c == 2 : print ( i , "(prime)" , end = '' ) print ( ) else : t = i while t % 2 == 0 : print ( "2" , end = 'x' ) t = t // 2 k = 3 x = math . ceil ( math . sqrt ( t ) ) + 1 while k <= x : while ( t % k == 0 ) : print ( k , end = 'x' ) t = t // k k += 2 if t > 2 : print ( t , end = 'x' )

 s=input("Enter Value or String :") if (s==s[::-1]) :     print(s, "is a Palindrome.") else:         print(s, "is NOT a Palindrome.")