SP28598 BDOI16B - Beautiful Factorial Game

**Beautiful Factorial Game** The statement of this problem is very simple. Given two number n and k, you need to find the maximum power of k (i.e. x) such that n! % k^x = 0. Here n! is the notation of n factorial. If you are not familiar with the notation, n! = 1 \* 2 \* 3 \* 4 \* 5 \* 6 ….. \* n **Input:** First line of the input will contain an integer t (1

N/A

N/A