A14936 | Factorials and Powers of Two
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
A number is called powerful if it is a power of two or a factorial. In other words, the number $m$ is powerful if there exists a non-negative integer $d$ such that $m=2^d$ or $m=d!$ , where $d!=1\cdot 2\cdot \ldots \cdot d$ (in particular, $0! = 1$ ). For example $1$ , $4$ , and $6$ are powerful numbers, because $1=1!$ , $4=2^2$ , and $6=3!$ but $7$ , $10$ , or $18$ are not.
You are given a positive integer $n$ . Find the minimum number $k$ such that $n$ can be represented as the sum of $k$ distinct powerful numbers, or say that there is no such $k$ .
You are given a positive integer $n$ . Find the minimum number $k$ such that $n$ can be represented as the sum of $k$ distinct powerful numbers, or say that there is no such $k$ .
输入格式
Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 100$ ). Description of the test cases follows.
A test case consists of only one line, containing one integer $n$ ( $1\le n\le 10^{12}$ ).
A test case consists of only one line, containing one integer $n$ ( $1\le n\le 10^{12}$ ).
输出格式
For each test case print the answer on a separate line.
If $n$ can not be represented as the sum of distinct powerful numbers, print $-1$ .
Otherwise, print a single positive integer — the minimum possible value of $k$ .
If $n$ can not be represented as the sum of distinct powerful numbers, print $-1$ .
Otherwise, print a single positive integer — the minimum possible value of $k$ .
输入输出样例
输入 #1
4 7 11 240 17179869184
输出 #1
2 3 4 1
In the first test case, $7$ can be represented as $7=1+6$ , where $1$ and $6$ are powerful numbers. Because $7$ is not a powerful number, we know that the minimum possible value of $k$ in this case is $k=2$ .
In the second test case, a possible way to represent $11$ as the sum of three powerful numbers is $11=1+4+6$ . We can show that there is no way to represent $11$ as the sum of two or less powerful numbers.
In the third test case, $240$ can be represented as $240=24+32+64+120$ . Observe that $240=120+120$ is not a valid representation, because the powerful numbers have to be distinct.
In the fourth test case, $17179869184=2^{34}$ , so $17179869184$ is a powerful number and the minimum $k$ in this case is $k=1$ .
In the second test case, a possible way to represent $11$ as the sum of three powerful numbers is $11=1+4+6$ . We can show that there is no way to represent $11$ as the sum of two or less powerful numbers.
In the third test case, $240$ can be represented as $240=24+32+64+120$ . Observe that $240=120+120$ is not a valid representation, because the powerful numbers have to be distinct.
In the fourth test case, $17179869184=2^{34}$ , so $17179869184$ is a powerful number and the minimum $k$ in this case is $k=1$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted