Amr and Chemistry---cf558C(暴力，加技巧)

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#define N 100100
#define INF 0x3f3f3f3f
#define met(a, b) memset(a, b, sizeof(a))
using namespace std;

int  num[N], cnt[N];

void F(int x)
{
    int step = 0, t = x;

    cnt[x] ++;

    while(t*2 < N)///往上*2得到的都是偶数，直接记录；
    {
        t = t*2;
        step ++;
        num[t] += step;
        cnt[t] ++;
    }

    t = x, step = 0;

    while(t > 1)
    {
        if(t!=1 && t%2==1)///往下/2得到的可能是奇数， 如果是奇数的话继续往上*2；
        {
            int y = t/2;
            int step0 = step+1;
            while(y*2 < N)
            {
                y = y*2;
                step0 ++;
                num[y] += step0;
                cnt[y] ++;
            }
        }
        t = t/2;
        step ++;
        num[t] += step;
        cnt[t] ++;
    }
}

int main()
{
    int n, x;
    while(scanf("%d", &n)!=EOF)
    {
        met(cnt, 0);
        met(num, 0);
        for(int i=0; i<n; i++)
        {
            scanf("%d", &x);
            F( x );
        }
        int ans = INF;
        for(int i=0; i<N; i++)
        {
            if(n == cnt[i])
                ans = min(ans, num[i]);
        }
        printf("%d\n", ans);
    }
    return 0;
}