AOJ 506 - 整除问题

整除问题

Time Limit: 1000ms

Memory Limit: 32768KB

64-bit integer IO format: %lld Java class name: Main

Prev

Submit Status Statistics

Next

Font Size:

Description

给定n，a求最大的k，使n！可以被a^k整除但不能被a^(k+1)整除。

Input

两个整数n(2<=n<=1000)，a(2<=a<=1000)

Output

一个整数.

Sample Input

6 10
10 6

Sample Output

1
4

Author

Admin

Language:

Theme:

Share Code? Yes No