C. Factorials and Powers of Two-Codeforces Round #774 (Div. 2)

最新推荐文章于 2024-09-22 11:42:19 发布

qinsanma and Code

最新推荐文章于 2024-09-22 11:42:19 发布

阅读量132

点赞数 2

分类专栏： codeforces 文章标签： codeforces 算法 c++

本文链接：https://blog.csdn.net/jisuanji2606414/article/details/125296943

版权

codeforces 专栏收录该内容

131 篇文章 6 订阅

订阅专栏

Problem - 1646C - Codeforces

C. Factorials and Powers of Two

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A number is called powerful if it is a power of two or a factorial. In other words, the number mm is powerful if there exists a non-negative integer dd such that m=2dm=2d or m=d!m=d!, where d!=1⋅2⋅…⋅dd!=1⋅2⋅…⋅d (in particular, 0!=10!=1). For example 11, 44, and 66 are powerful numbers, because 1=1!1=1!, 4=224=22, and 6=3!6=3! but 77, 1010, or 1818 are not.

You are given a positive integer nn. Find the minimum number kk such that nn can be represented as the sum of kk distinct powerful numbers, or say that there is no such kk.

Input

Each test contains multiple test cases. The first line contains the number of test cases tt (1≤t≤1001≤t≤100). Description of the test cases follows.

A test case consists of only one line, containing one integer nn (1≤n≤10121≤n≤1012).

Output

For each test case print the answer on a separate line.

If nn can not be represented as the sum of distinct powerful numbers, print −1−1.

Otherwise, print a single positive integer — the minimum possible value of kk.

Example

input

Copy

4
7
11
240
17179869184

output

Copy

Note

In the first test case, 77 can be represented as 7=1+67=1+6, where 11 and 66 are powerful numbers. Because 77 is not a powerful number, we know that the minimum possible value of kk in this case is k=2k=2.

In the second test case, a possible way to represent 1111 as the sum of three powerful numbers is 11=1+4+611=1+4+6. We can show that there is no way to represent 1111 as the sum of two or less powerful numbers.

In the third test case, 240240 can be represented as 240=24+32+64+120240=24+32+64+120. Observe that 240=120+120240=120+120 is not a valid representation, because the powerful numbers have to be distinct.

In the fourth test case, 17179869184=23417179869184=234, so 1717986918417179869184 is a powerful number and the minimum kk in this case is k=1k=1.

==================================================================================================================================================

一个是阶乘，一个是2的某次幂，值得注意的是阶乘最多不会超过15，故可以dfs枚举选的阶乘，剩下的2的某次幂，用二进制的1个数来表示，比如剩下的是5，

二进制表示为101，那么就是选了两个，题目说了2的某次幂每个只能选择一次，正好符合每个数字都有二进制表示且每一位都是2的某次幂的特质。

# include<iostream>

typedef long long int ll;
using namespace std;

ll  getcnt(ll x)
{

    ll ans=0;

    while(x)
    {
        if(x%2)
            ans++;

        x>>=1;

    }

    return ans;

}
ll fac[100];

ll ans=0;

void dfs(ll pos,ll rest, ll cnt)
{
    if(pos>=16)
    {
        ans=min(ans,cnt+getcnt(rest));

        return ;

    }

    if(rest-fac[pos]>=0)
    {
        dfs(pos+1,rest-fac[pos],cnt+1);

    }

    dfs(pos+1,rest,cnt);



}
int main ()
{

     fac[0]=1;

     for(ll i=1;i<=15;i++)
     {
         fac[i]=fac[i-1]*i;

     }

     int t;

     cin>>t;

     while(t--)
     {

         ll n;

         cin>>n;

         ans=9999999;


         dfs(1,n,0);

         cout<<ans<<endl;

     }




    return 0;

}