CF753A.Santa Claus and Candies

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Santa Claus has $n$ candies, he dreams to give them as gifts to children.

What is the maximal number of children for whose he can give candies if Santa Claus want each kid should get distinct positive integer number of candies. Santa Class wants to give all $n$ candies he has.

输入格式

The only line contains positive integer number $n$ ( $1<=n<=1000$ ) — number of candies Santa Claus has.

输出格式

Print to the first line integer number $k$ — maximal number of kids which can get candies.

Print to the second line $k$ distinct integer numbers: number of candies for each of $k$ kid. The sum of $k$ printed numbers should be exactly $n$ .

If there are many solutions, print any of them.

输入输出样例

输入#1
```
5
```
输出#1
```
2
2 3
```
输入#2
```
9
```
输出#2
```
3
3 5 1
```
输入#3
```
2
```
输出#3
```
1
2 
```

首页