Description: Algorithm design. 3 classic integer division problem.- Input each input two integers n and k. (1 <= n <= 50, 1 <= k <= n) Output for each input, please output four lines. First line: n divided into a number of positive integers and the division of a few. The second line: The maximum number n divided into k division of no more than a few. Third line: n divided into a number of odd positive integers and the division of a few. Fourth line: n divided into a number of different integers and the division of a few.
To Search:
File list (Check if you may need any files):