NXT

WAVE.

PROBLEM SOLVING

INSTRUCTIONS

Description

Submissions

Bit matching challenge

tn Progrest Enity.

Helpful

Wrie a program to devermine the number of bits in the binary number that most be changed so accurately represent the given decimal number in binary format. The input consists of an array of strings containing evactly two elements: the first element is a positive decimal number, and the second element is a binary number. The ourput ahoudd be an inneger representing the minimum number of bit flips required to manch the binary represtentation of the decimal number:

Inpent Format

An array of strings, strArr, contisning two ebemertas:

The first elerient is a porithe decirtal number within the range $1$ a decimal $2***31-1$

Thithcond comentiratinarymumber, reperesented as a Wring of $1$ so $32$ characters. This bieary string represents the eocinal number with or'without leading aerop.

Output Format

Animegar repietergegthe minimum number of bit lips $10$ to $1$ or $1$ is $9$