zoj 1850 Factovisors

 

Factovisors
Time Limit: 1 Second       Memory Limit: 32768 KB

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


Input

The input to your program consists of several lines, each containing two non-negative integers, n and m, both less than 2^31.


Output

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


Sample Input

6 9
6 27
20 10000
20 100000
1000 1009


Sample Output

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


 

Source: University of Waterloo Local Contest 1999.01.31

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值