TLE '16 Contest 7 P4 - Abstract Problem

View as PDF

Submit solution

Points: 10 (partial)
Time limit: 1.0s
Python 2 6.0s
Python 3 6.0s
Memory limit: 256M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
Abstract art, like abstract problems, is very enjoyable.

You see an abstract problem on Codeforces.

Given an integer x you want to change 0 into that number using a minimal number of the following operations:

  • Add 1
  • Subtract 1
  • Multiply by 2

You think it is too easy, so you increase x to X (1 \le X < 2^{63}), and decide that you should answer T (T \le 300\,000) of these queries per test case.

Input Specification

The first line of input will contain T.

The next T lines of input will each contain X.

Output Specification

For each X, output on separate lines the minimal number of operations necessary to change 0 into X.

Sample Input


Sample Output



There are no comments at the moment.