Codeforces Round #828 (Div. 3) D. Divisibility by 2^n

Codeforces Round #828 (Div. 3) D. Divisibility by 2^n

• Let’s notice that if we multiply the numbers $a_1\cdot a_2\cdot \cdot \cdot \cdot \cdot \cdot a_n$, then the power of two of the product is equal to the sum of the powers of two in each of the numbers.
• Let’s calculate the initial sum of the powers of twos in the product. This can be done as follows: let’s take the element $a_i$ and divide it by $2$ as long as we can, while remembering to increase our counter by the number of occurrences of a power of two.
• Now let’s move on to operations and note that choosing the index $i$ will increase the degree of occurrence of two by a fixed number (that is, it does not matter when to apply this operation). Choosing an index $i$ will increment the counter by a number $x$ such that $i$ is divisible by $2^x$ but not by $2^{x+1}$ — you can find this $x$, again , by dividing by $2$ while we can.
• Since we want to minimize the number of operations used, at each moment of time we will try to use an index that increases the counter by the largest number. To do this, it is enough to sort the indices by this index of increase and take them greedily from the largest increase to the smallest.
• We get the solution in $O(nlogn+nlogA).$
• 问所有的数字相乘之后，最多还可与 $1-n$ 各个数字相乘，能否整除 $2^n$ ，就是判断每个数字分解之后有多少个2。如果不够再加上 $1-n$ 之间的 $i$ ,在进行计算。

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int T;cin>>T;
    while(T--)
    {
        int n;cin>>n;
        int sum=0;
        for(int i=0;i<n;i++)
        {
            int x;cin>>x;
            sum+=__builtin_ctz(x);
        }

        vector<int> cnt(20);
        for(int i=1;i<=n;i++)
            cnt[__builtin_ctz(i)]++;

        int ans=0;
        for(int i=19;i>=0;i--)
            while(sum<n && cnt[i])
            {
                sum+=i;
                cnt[i]--;
                ans++;
            }

        if(sum<n) ans=-1;
        cout<<ans<<endl;
    }
    return 0;
}