Problem in tc 5 -- A factorial Proble,

#1

https://ide.codingblocks.com/s/208178 - This is my code ide

  1. create a prime sieve and then make a list of prime

  2. given n,k . Obtaing prime factorization of k and store it in a map

3 Go through the factors and find their count in n! , and use the relation answer = min(answer,occ(n!) - occ(k)+1)
Please Help ME ASAP

#2

@debyian
Your code failed just 1 problem of test case 5
Maybe you would like to figure out the issue once yourself

Q : 40335377 61296961
A : 136267
Your answer : 161340