2022蓝桥杯——砍竹子

 

 

/*
 * @Description: To iterate is human, to recurse divine.
 * @Autor: Recursion
 * @Date: 2022-05-27 18:05:28
 * @LastEditTime: 2022-05-27 21:23:08
 */
#include <bits/stdc++.h>
#define LL long long 
using namespace std;
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e9 + 10;
const int N = 1e4;
const int M = 10;
LL f[N][M];
LL n;
LL a[N];
LL top;
LL m;
LL ans;


int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin  >> n;
    for(int i = 1;i <= n;i ++){
        LL x;
        cin >> x;
        top = 0;
        while(x > 1){
            a[++top] = x;
            x = sqrt(x/2 + 1);
        }
        // for(int i = 1;i <= top;i ++)
        //     cout << a[i] << " ";
        // cout << endl;
        m = max(top,m);
        for(int k=1,j=top;j;k++,j--){
            f[i][k] = a[j];
        }
        ans += top;
    }
    for(int i = 1;i <= m;i ++){
        for(int j = 2;j <= n;j ++)
            if(f[j][i]&&f[j][i] == f[j - 1][i])
                ans--;
    }
    cout << ans << endl;


    return 0;
}