Coding Maniac

2026 Progress 0.000000% of 2026 has passed

Personalized PDF Generator Generate Your Personalized PDF Enter your name: Download PDF

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()