Hamming Distance in c/c++

What is Hamming distance ?

Definition: 

A Hamming distance represents in information Technology the number of points at which two corresponding pieces of data can be different. and the two string will be always same length . otherwise it will not work. the total difference between every position  known as hamming distance.

Example:

 a string is 101010

 b string is 011101

so here hamming distance will be 5 . 

Implementation:

#include<bits/stdc++.h> using namespace std; int main() { char a[50],b[50]; cout<<"Enter the two value: "<<endl; cin>>a>>b; int so=strlen(a); int io=strlen(b); int i,counter=0; for(i=0;i<so;i++) { if(a[i]!=b[i]) { counter++; } } cout<<"Hamming Distance is: "<<counter<<endl; return 0; }

Output: