NXT

WAVG.

PROBLEM SOLVING

Instructions

Description

Bit matching challenge

In Progress Easy

Wribe a program to debermine the number of bits in the binary number that must be changed to accurately represent the given decimal number in binary format ine inpul conlisis of an arriyy of strings containing exactly two elements: the first element is a positive oecimal number, and the second element is a binary number. The thot thotst to an ingoger ouproserting the mintilum number of bit fips requied to match the binary representasion of the decimal number.

Inpet Format

An array of strings, strierr $.$cootaining two elements

The first eleclent is a posidive decimal number within the tange $2**31=13={}_{\text{;}}$