1 条题解
-
1
#include <bits/stdc++.h> using namespace std; typedef long long ll; int count2(ll x) { int cnt = 0; while (x % 2 == 0) { cnt++; x /= 2; } return cnt; } int n; int main() { ll x; cin >> n; int min_cnt = INT_MAX;
for (int i = 1; i <= n; i++) { cin >> x; int c = count2(x); if (c < min_cnt) { min_cnt = c; } if (min_cnt == 0) { break; } } cout << min_cnt << endl; return 0; }
- 1
信息
- ID
- 6235
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 7
- 标签
- 递交数
- 134
- 已通过
- 36
- 上传者