Preparando MOJI

Hamming Distance

2000ms 262144K

Description:

Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. You are given two strings; calculate the distance between them.

Input:

The input consists of two lines. Each line contains a string of characters 'A'-'Z' between 1 and 100 characters, inclusive. The strings have equal length.

Output:

Output Hamming distance between the strings.

Sample Input:

CODECHEF
TOPCODER

Sample Output:

6

Sample Input:

HAMMING
DISTANC

Sample Output:

6

Informação

Codeforces

Provedor Codeforces

Código CF470G

Tags

*special

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:53:43

Relacionados

Nada ainda