文件名称:number-of-partitions
介绍说明－－下载内容均来自于网络，请自行研究使用
问题描述：
整数划分是一个经典的问题。希望这道题会对你的组合数学的解题能力有所帮助。
输入：
每组输入是两个整数n和k。(1 <= n <= 50, 1 <= k <= n)
输出：
对于每组输入，请输出六行。
第一行： 将n划分成若干正整数之和的划分数。
第二行： 将n划分成k个正整数之和的划分数。
第三行： 将n划分成最大数不超过k的划分数。
第四行： 将n划分成若干奇正整数之和的划分数。
第五行： 将n划分成若干不同整数之和的划分数。 -Problem Descr iption: Integer division is a classic problem. I hope this question your ability to be a combination of mathematical problem-solving help. Input: Each input two integers n and k. (1 < = n < = 50, 1 < = k < = n) Output: For each input, six output lines. First line: divide the number n is divided into a number of positive integers and the. Second row: k will be divided into n positive integers and the division number. Third line: n divided into no more than the maximum number of division number k. Fourth line: divide the number n is divided into a number of odd positive integers. Fifth row: divide the number n is divided into a number of different integers and the.
整数划分是一个经典的问题。希望这道题会对你的组合数学的解题能力有所帮助。
输入：
每组输入是两个整数n和k。(1 <= n <= 50, 1 <= k <= n)
输出：
对于每组输入，请输出六行。
第一行： 将n划分成若干正整数之和的划分数。
第二行： 将n划分成k个正整数之和的划分数。
第三行： 将n划分成最大数不超过k的划分数。
第四行： 将n划分成若干奇正整数之和的划分数。
第五行： 将n划分成若干不同整数之和的划分数。 -Problem Descr iption: Integer division is a classic problem. I hope this question your ability to be a combination of mathematical problem-solving help. Input: Each input two integers n and k. (1 < = n < = 50, 1 < = k < = n) Output: For each input, six output lines. First line: divide the number n is divided into a number of positive integers and the. Second row: k will be divided into n positive integers and the division number. Third line: n divided into no more than the maximum number of division number k. Fourth line: divide the number n is divided into a number of odd positive integers. Fifth row: divide the number n is divided into a number of different integers and the.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
划分数.cpp