
ZOJ Problem Set  1850
The factorial function, n! is defined thus for n a nonnegative integer: 0! = 1 n! = n * (n  1)! (n > 0) We say that a divides b if there exists an integer k such that
The input to your program consists of several lines, each containing two nonnegative integers, n and m, both less than 2^31.
For each input line, output a line stating whether or not m divides n!, in the format shown below.
9 divides 6! Source: University of Waterloo Local Contest 1999.01.31 