Guest
Login
跳过导航链接

借书方案
Time Limit:1000MS  Memory Limit:32768K

Description:

丽丽有M本不同的书,要借给N个小朋友(N<=M),若每人每次只能借1本,则可以有多少种不同的借法?

Input:

一些整数对,每对整数M和N(N<=M,1<=M<=12)。

Output:

整数,每个输出占一行。

Sample Input:

5 3
3 2

Sample Output:

60
6

Hint:

qn
Submit Your Solution


Zhe Jiang University Of Technology Online Programming Space Beta1.3
Designed & Developped By Jin Qiwei
Refactored By cb@zjut.edu.cn , QQ Group: 723311416  All Copyright Reserved 2006-
212