Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Hamming Distance of Two bit-strings

    The hamming distance between two bit-strings is the number of positions those bit-strings are different. Given two bit-strings you are asked to calculate the hamming distance between those two.

    Input

    The input contains two lines each one representing one of the two bit-strings. Both of the bit-strings are guaranteed to have the same length (1 ≤ |s1| = |s2| ≤ ).

    Output

    The program should print the hamming distance between those bit-strings.

    Examples

    Input
    Output
    100101 110111
    2

    Explanation

    100101 and 110111 differ in positions (1-based) 2 and 5.
    s1[2] ≠ s2[2] and s1[5] ≠ s2[5]
     

    Constraints

    Time limit: 2 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue