|
|||
Hamming DistanceHave you ever heard of the Hamming distance. It is the number of positions for which the corresponding digits differ. Your task is to write a program that computes this distance for two binary strings. Input Specification
The input contains several test cases. Each test case consists of two lines. Each line contains
one binary number. Any two numbers given in one test case have the same length, which is at
most 100 binary digits. The last test case is followed by a line containing the uppercase letter
" Output Specification
Your program must output a single line for each test case. The line should contain the statement
" Sample Input
Output for Sample Input
|
|||
University of Debrecen; Faculty of Informatics; v. 03/01/2019 |