Suppose you have an integer $$$v$$$. In one operation, you can:
You are given $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$. What is the minimum number of operations you need to make each $$$a_i$$$ equal to $$$0$$$?
The first line contains the single integer $$$n$$$ ($$$1 \le n \le 32768$$$) — the number of integers.
The second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$0 \le a_i < 32768$$$).
Print $$$n$$$ integers. The $$$i$$$-th integer should be equal to the minimum number of operations required to make $$$a_i$$$ equal to $$$0$$$.
4 19 32764 10240 49
14 4 4 15
Let's consider each $$$a_i$$$:
Name |
---|