每日打卡~
,
思路:求数组中有多少个2 的因数,如果大于等于n就为0,如果不满足就从1-n找有多少个n的因数(排序一下),之后判断一下输出就好。
代码:
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/
#include<cstdio>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include<vector>
#include<queue>
#include<map>
#define ll long long
using namespace std;
const int N=1000000+100;
int n ,m,h;
ll s[N];
ll cnt[N];
int main()
{
int t ;
cin>>t;
while(t--)
{
int n;
cin>>n;
int res=0;
for(int i =1;i<=n;i++)
{
cin>>s[i];
while(s[i]%2==0){
s[i]/=2;
res++;
}
}
int time=0;
for(int i =1;i<=n;i++)
{
int res=0;
int j=i;
while(j%2==0){
j/=2;
res++;
}
cnt[i]=res;
}
sort(cnt+1,cnt+1+n);
for(int i=n;i>=1;i--)
{
int p=0;
if(res>=n){
cout<<time<<endl;
break;
}
res+=cnt[i];
time++;
}
if(res<n)
cout<<"-1"<<endl;
}
return 0;
}