题目链接:https://codeforces.com/contest/558/problem/C
题目大意:给n个数,两种操作,要么*2,要么/2向下取整,求使得所有数字相同的最少操作数
题目思路:对于每个a[i],暴力出它能到的所有点和所需步数,易得只有他是奇数时,/2向下取整再不断*2会产生新的没有到过的数字,由此直接暴力即可。最后对于每个点找一找n个数都能到的最小步数即可
以下是代码:
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<math.h>
#include<map>
using namespace std;
#define inf 0x3f3f3f3f
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
#define ll long long
const int MAXN = 1e5+5;
const int MOD = 1e9+7;
int n,a[MAXN],vis[MAXN],cnt[MAXN];
int main()
{
while(~scanf("%d",&n)){
memset(vis,0,sizeof(vis));
memset(cnt,0,sizeof(cnt));
rep(i,1,n)scanf("%d",&a[i]);
rep(i,1,n){
int step=0,temp=a[i];
while(temp<MAXN){
vis[temp]++;
cnt[temp]+=step;
temp<<=1;
step++;
}
step=0;
while(a[i]>1){
if(a[i]&1){
int temp=a[i]>>1;
int p=step+2;
temp<<=1;
while(temp<MAXN){
vis[temp]++;
cnt[temp]+=p;
temp<<=1;
p++;
}
}
a[i]>>=1;
vis[a[i]]++;
step++;
cnt[a[i]]+=step;
}
}
int ans=inf;
rep(i,0,1e5){
if(vis[i]==n){
ans=min(ans,cnt[i]);
}
}
cout<<ans<<endl;
}
return 0;
}