문제1152--Factovisors

1152: Factovisors

실행시간 제한: 1 Sec  메모리사용 제한: 128 MB
제출: 127  통과: 25
[제출] [채점기록] [묻고답하기]

문제 설명

The factorial function, n! is defined thus for n a non-negative integer: 
    0! = 1
    n! = n * (n-1)!   (n > 0)

We say that a divides b if there exists an integer k such that 
    k*a = b

입력 설명

The input to your program consists of several lines, each containing two non-negative integers, n and m, both less than 231. The last line of input contains 0 0.

출력 설명

For each input line, output a line stating whether or not m divides n!, in the format shown below.

입력 예시 Copy

6 9
6 27
20 10000
20 100000
1000 1009
0 0

출력 예시 Copy

9 divides 6!
27 does not divide 6!
10000 divides 20!
100000 does not divide 20!
1009 does not divide 1000!

출처/분류