0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-12 00:26:26 +00:00
OI-codes/Codeforces/1688/B/B.cpp

40 lines
613 B
C++

#include <iostream>
#include <algorithm>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 2e5 + 5;
int t, n, a[N];
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> t;
while (t--) {
int ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] = __builtin_ffs(a[i]) - 1;
}
ans = std::max(*std::min_element(a + 1, a + 1 + n) - 1, 0);
for (int i = 1; i <= n; i++) {
if (a[i] > 0) ans++;
}
cout << ans << endl;
}
return 0;
}