A13396 | Phoenix and Science
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Phoenix has decided to become a scientist! He is currently investigating the growth of bacteria.
Initially, on day $1$ , there is one bacterium with mass $1$ .
Every day, some number of bacteria will split (possibly zero or all). When a bacterium of mass $m$ splits, it becomes two bacteria of mass $\frac{m}{2}$ each. For example, a bacterium of mass $3$ can split into two bacteria of mass $1.5$ .
Also, every night, the mass of every bacteria will increase by one.
Phoenix is wondering if it is possible for the total mass of all the bacteria to be exactly $n$ . If it is possible, he is interested in the way to obtain that mass using the minimum possible number of nights. Help him become the best scientist!
Initially, on day $1$ , there is one bacterium with mass $1$ .
Every day, some number of bacteria will split (possibly zero or all). When a bacterium of mass $m$ splits, it becomes two bacteria of mass $\frac{m}{2}$ each. For example, a bacterium of mass $3$ can split into two bacteria of mass $1.5$ .
Also, every night, the mass of every bacteria will increase by one.
Phoenix is wondering if it is possible for the total mass of all the bacteria to be exactly $n$ . If it is possible, he is interested in the way to obtain that mass using the minimum possible number of nights. Help him become the best scientist!
输入格式
The input consists of multiple test cases. The first line contains an integer $t$ ( $1 \le t \le 1000$ ) — the number of test cases.
The first line of each test case contains an integer $n$ ( $2 \le n \le 10^9$ ) — the sum of bacteria masses that Phoenix is interested in.
The first line of each test case contains an integer $n$ ( $2 \le n \le 10^9$ ) — the sum of bacteria masses that Phoenix is interested in.
输出格式
For each test case, if there is no way for the bacteria to exactly achieve total mass $n$ , print -1. Otherwise, print two lines.
The first line should contain an integer $d$ — the minimum number of nights needed.
The next line should contain $d$ integers, with the $i$ -th integer representing the number of bacteria that should split on the $i$ -th day.
If there are multiple solutions, print any.
The first line should contain an integer $d$ — the minimum number of nights needed.
The next line should contain $d$ integers, with the $i$ -th integer representing the number of bacteria that should split on the $i$ -th day.
If there are multiple solutions, print any.
输入输出样例
输入 #1
3 9 11 2
输出 #1
3 1 0 2 3 1 1 2 1 0
In the first test case, the following process results in bacteria with total mass $9$ :
- Day $1$ : The bacterium with mass $1$ splits. There are now two bacteria with mass $0.5$ each.
- Night $1$ : All bacteria's mass increases by one. There are now two bacteria with mass $1.5$ .
- Day $2$ : None split.
- Night $2$ : There are now two bacteria with mass $2.5$ .
- Day $3$ : Both bacteria split. There are now four bacteria with mass $1.25$ .
- Night $3$ : There are now four bacteria with mass $2.25$ .
The total mass is $2.25+2.25+2.25+2.25=9$ . It can be proved that $3$ is the minimum number of nights needed. There are also other ways to obtain total mass 9 in 3 nights. $ $
In the second test case, the following process results in bacteria with total mass $11$ :
- Day $1$ : The bacterium with mass $1$ splits. There are now two bacteria with mass $0.5$ .
- Night $1$ : There are now two bacteria with mass $1.5$ .
- Day $2$ : One bacterium splits. There are now three bacteria with masses $0.75$ , $0.75$ , and $1.5$ .
- Night $2$ : There are now three bacteria with masses $1.75$ , $1.75$ , and $2.5$ .
- Day $3$ : The bacteria with mass $1.75$ and the bacteria with mass $2.5$ split. There are now five bacteria with masses $0.875$ , $0.875$ , $1.25$ , $1.25$ , and $1.75$ .
- Night $3$ : There are now five bacteria with masses $1.875$ , $1.875$ , $2.25$ , $2.25$ , and $2.75$ .
The total mass is $1.875+1.875+2.25+2.25+2.75=11$ . It can be proved that $3$ is the minimum number of nights needed. There are also other ways to obtain total mass 11 in 3 nights. $ $
In the third test case, the bacterium does not split on day $1$ , and then grows to mass $2$ during night $1$ .
- Day $1$ : The bacterium with mass $1$ splits. There are now two bacteria with mass $0.5$ each.
- Night $1$ : All bacteria's mass increases by one. There are now two bacteria with mass $1.5$ .
- Day $2$ : None split.
- Night $2$ : There are now two bacteria with mass $2.5$ .
- Day $3$ : Both bacteria split. There are now four bacteria with mass $1.25$ .
- Night $3$ : There are now four bacteria with mass $2.25$ .
The total mass is $2.25+2.25+2.25+2.25=9$ . It can be proved that $3$ is the minimum number of nights needed. There are also other ways to obtain total mass 9 in 3 nights. $ $
In the second test case, the following process results in bacteria with total mass $11$ :
- Day $1$ : The bacterium with mass $1$ splits. There are now two bacteria with mass $0.5$ .
- Night $1$ : There are now two bacteria with mass $1.5$ .
- Day $2$ : One bacterium splits. There are now three bacteria with masses $0.75$ , $0.75$ , and $1.5$ .
- Night $2$ : There are now three bacteria with masses $1.75$ , $1.75$ , and $2.5$ .
- Day $3$ : The bacteria with mass $1.75$ and the bacteria with mass $2.5$ split. There are now five bacteria with masses $0.875$ , $0.875$ , $1.25$ , $1.25$ , and $1.75$ .
- Night $3$ : There are now five bacteria with masses $1.875$ , $1.875$ , $2.25$ , $2.25$ , and $2.75$ .
The total mass is $1.875+1.875+2.25+2.25+2.75=11$ . It can be proved that $3$ is the minimum number of nights needed. There are also other ways to obtain total mass 11 in 3 nights. $ $
In the third test case, the bacterium does not split on day $1$ , and then grows to mass $2$ during night $1$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted