AtCoder Beginner Contest 081
翻译中…
Problem Statement
翻译中…
There are $N$ positive integers written on a blackboard: $A_1, ..., A_N$.
翻译中…
Snuke can perform the following operation when all integers on the blackboard are even:
翻译中…
- Replace each integer
$X$on the blackboard by$X$divided by$2$.
翻译中…
Find the maximum possible number of operations that Snuke can perform.
翻译中…
Constraints
翻译中…
$1 \leq N \leq 200$$1 \leq A_i \leq 10^9$
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N
A_1 A_2 ... A_N翻译中…
Output
翻译中…
Print the maximum possible number of operations that Snuke can perform.
翻译中…
样例
Input #1
3
8 12 40
Output #1
2
Initially, $[8, 12, 40]$ are written on the blackboard. Since all those integers are even, Snuke can perform the operation.
After the operation is performed once, $[4, 6, 20]$ are written on the blackboard. Since all those integers are again even, he can perform the operation.
After the operation is performed twice, $[2, 3, 10]$ are written on the blackboard. Now, there is an odd number $3$ on the blackboard, so he cannot perform the operation any more.
Thus, Snuke can perform the operation at most twice.
Input #2
4
5 6 8 10
Output #2
0
Since there is an odd number $5$ on the blackboard already in the beginning, Snuke cannot perform the operation at all.
Input #3
6
382253568 723152896 37802240 379425024 404894720 471526144
Output #3
8
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。