codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1277B.md (1841B)


      1 Source: https://codeforces.com/problemset/problem/1277/B
      2 
      3 B. Make Them Odd
      4 
      5 time limit per test
      6 
      7 3 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 There are $n$ positive integers $a_1, a_2, \dots, a_n$. For the one move you can choose any even value $c$ and divide by two all elements that equal $c$.
     22 
     23 For example, if $a=[6,8,12,6,3,12]$ and you choose $c=6$, and $a$ is transformed into $a=[3,8,12,3,3,12]$ after the move.
     24 
     25 You need to find the minimal number of moves for transforming $a$ to an array of only odd integers (each element shouldn't be divisible by $2$).
     26 
     27 Input
     28 
     29 The first line of the input contains one integer $t$ ($1 \le t \le 10^4$) — the number of test cases in the input. Then $t$ test cases follow.
     30 
     31 The first line of a test case contains $n$ ($1 \le n \le 2\cdot10^5$) — the number of integers in the sequence $a$. The second line contains positive integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$).
     32 
     33 The sum of $n$ for all test cases in the input doesn't exceed $2\cdot10^5$.
     34 
     35 Output
     36 
     37 For $t$ test cases print the answers in the order of test cases in the input. The answer for the test case is the minimal number of moves needed to make all numbers in the test case odd (i.e. not divisible by $2$).
     38 
     39 Example
     40 
     41 Input
     42 
     43 ```
     44 4
     45 6
     46 40 6 40 3 20 1
     47 1
     48 1024
     49 4
     50 2 4 8 16
     51 3
     52 3 1 7
     53 ```
     54 
     55 Output
     56 
     57 ```
     58 4
     59 10
     60 4
     61 0
     62 ```
     63 
     64 Note
     65 
     66 In the first test case of the example, the optimal sequence of moves can be as follows:
     67 
     68 * before making moves $a=[40, 6, 40, 3, 20, 1]$;
     69 * choose $c=6$;
     70 * now $a=[40, 3, 40, 3, 20, 1]$;
     71 * choose $c=40$;
     72 * now $a=[20, 3, 20, 3, 20, 1]$;
     73 * choose $c=20$;
     74 * now $a=[10, 3, 10, 3, 10, 1]$;
     75 * choose $c=10$;
     76 * now $a=[5, 3, 5, 3, 5, 1]$ — all numbers are odd.
     77 
     78 Thus, all numbers became odd after $4$ moves. In $3$ or fewer moves, you cannot make them all odd.