![]() |
||||||||||
|
||||||||||
兑换零钱Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1 Accepted Submission(s): 1 Problem Description 将10000块钱兑换成由5000块、2000块、1000块、500块、100块、50块、10块、5块、1块的组成的零钱,问有多少种兑换方式? Input 无输入 Output 运算结果。 Sample Output
Source | ||||||||||
|