SWUST OJ 56 Hamming Distance

swust oj 56

题目描述

Have 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.

输入

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 “X”.

输出

Your program must output a single line for each test case. The line should contain the statement “Hamming distance is X.”, where X is the number of positions where the two numbers have different digits.

样例输入

样例输出

源代码

#include<stdio.h> 
#include<string.h>
int main()
{
	char s[100],a[100];
	int n;
	while(scanf("%s",&s)!=EOF)
	{
	     getchar();
	     if(s[0]=='X')
	     break;
		 scanf("%s",&a);
	     n=strlen(s);
      int m=0;
    for(int i=0;i<n;i++)
	{
		if(s[i]!=a[i])
		 m++;
	}
   printf("Hamming distance is %d.\n",m);
	}
	
}