Submission #7635703

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <queue>

using namespace std;

const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long

int main()
{
    int n;
    cin >> n;

    vector<int> vec(n);
    for (int i = 0; i < n; i++)
    {
        cin >> vec[i];
    }

    int ans = 0;
    while (true)
    {
        bool flag = false;
        for (int i = 0; i < n; i++)
        {
            if (vec[i] % 2 != 0)
            {
                flag = true;
                break;
            }
            
            vec[i] /= 2;
        }

        if (flag)
        {
            break;
        }
        
        ans++;
    }
    
    cout << ans << endl; 
}

Submission Info

Judge Result