经典简约
清爽简洁,回归本真
液态水晶
毛玻璃+霓虹光带
赛博朋克
霓虹故障艺术风
🚫
违规操作检测
禁止使用右键菜单
⚠️ 此操作已被系统记录
1

Graduates' Leaving

📝 题解 🔵 仅限 C++
题目描述
<p><span style="font-size: large;"><span style="font-family: Arial;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; June is the month for leaving. Many graduates have to leave colleage and they need to pick up their own&nbsp; things.&nbsp; TT is one of the graduates. He has M same books and N same boxes. He needs to divide these books into K(0&lt;K&lt;=N) groups and put them into the boxes. What's more, the boxes are allowed to be empty and are able to set as many books as he wants. <br /> &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; For example, now TT has 5 books and 3 boxes. (1,3,1),(1,1,3) and (3,1,1) are considered as the same division. &nbsp;<br /> &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Can you calculate how many divisions TT has.<br /> </span></span></p>
输入格式
<p><span style="font-size: large;"><span style="font-family: Arial;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; The input files consists of several test cases. Each test case has two integers M and N.(0&lt;M&lt;=300, 0&lt;N&lt;=300)<br /> </span></span></p>
输出格式
<p><span style="font-size: large;"><span style="font-family: Arial;">&nbsp;&nbsp;&nbsp;&nbsp; Output the answer for each test case in a single line.</span></span></p>
样例
样例输入 1
5 3 3 2
样例输出 1
5 2
提交代码
请先登录后提交

🤖 AI 解题助手

DeepSeek
就绪
👋 你好!我是 AI 解题助手。
我已阅读了这道题,可以帮你分析思路、提供代码示例。
⚠️ 请先登录后使用