Children's Apples | JXNUOJ
描述:
There are N children. Each child has a positive number, and the numbers are different from each other. Given the sum of all numbers of children. Find a possible assignment.
输入:
Two positive integers N (N <= 10) and the sum (sum <= 10000).
输出:
One line contains N integers.
样例输入:
5 24
样例输出:
2 4 5 6 7
翻译:
描述:
这有N个小孩,每个小孩有一个正整数数字,小孩之间的数字各不相同。给小孩们数字的总和,发现一种可能的情况。
输入:
两个正整数N (N <= 10)和sum(sum <= 10000)
输出:
一行包含N个数字。
样例输入:
5 24
样例输出:
2 4 5 6 7