Dont tell me the solution Yet
This is The Code IDE - https://ide.codingblocks.com/s/208655
Here Goes My approach
1 . Make a list of prime , then for n! , go through 1 to n , and store their prime factors in a map ,as well as store the log values ie for 2^8 I store 8log2 in a map at index 2 , this allows for easy multiplication
2. I do a recursive approach ie , for any prime factor we can either include it in the numerator or , in the denominator at the base case we check whether den > num or not
IT WOULD BE VERY HELPFUL IF YOU COULD TELL ME WHETHER MY APPROACH IS CORRECT OR NOR