同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22305_Factovisors

2022-5-16 18:21| 发布者: Hocassian| 查看: 21| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506308041300-Problem List-采集的数据-后羿采集器.html

Pro.ID

22305

Title

Factovisors

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22305

AC

Submit

Ratio

时间&空间限制

Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

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 2³¹.

输出

Description

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³¹.

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

Waterloo local 1999 January

样例输入