Welcome To SDIBT ACM-ICPC Online Judge

VIRTUAL JUDGE Recent Contest F.A.Qs Discuss Home ProblemSet Status Ranklist 19 Contest LoginRegister Exam
2017 ACM 集训队预选排名~      报名入口

Problem 1065. -- Factovisors

Factovisors

Time Limit: 1 Sec  Memory Limit: 64 MB
Submit: 10  Solved: 2
[Submit][Status][Discuss]

Description

The factorial function, n! is defined as follows for all non-negative integers n: 0! = 1 n! = n x (n - 1)! (n > 0) We say that a divides b if there exists an integer k such that k x a = b

Input

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

Output

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

```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 Contest Jan. 31, 1999

[Submit][Status][Discuss]

HOME Back

한국어 中文 English
All Copyright Reserved 2008-2010 SDIBT TEAM
GPL2.0 2003-2010 HUSTOJ Project TEAM