![]() | ||||
Online Judge | Problem Set | Authors | Online Contests | User |
---|---|---|---|---|
Web Board Home Page F.A.Qs Announcement | Current Contest Past Contests Scheduled Contests Award Contest |
Cake Pieces and Plates
Description kcm1700,
ntopia, suby, classic, tkwons, and their friends are having a birthday
party for kcm1700. Of course, there is a very large birthday cake. They
divide the birthday cake into undistinguishable pieces and put them on
identical plates. kcm1700 is curious, so he wants to know how many ways
there are to put m cake pieces on n plates. Input In the only input line, there are two integers n, m (1 ¡Ü n, m ¡Ü 4 500), which are the number of the plates and the number of the cake pieces respectively. Output If the number of ways is K, just output K mod 1000000007 because K can be very large. Sample Input Sample Output Hint There are 8 ways to fill 3 plates with 7 cakes, namely (0,0,7), (0,1,6), (0,2,5), (0,3,4), (1,1,5), (1,2,4), (1,3,3), (2,2,3). Source |
[Submit] [Go Back] [Status] [Discuss]
All Copyright Reserved 2003-2005 Ying Fuchen,Xu Pengcheng
Any problem, Please Contact Administrator