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

    • Toggle the bit

    Given an integer n, you are asked to toggle its i-th bit (turn 0 into 1 and 1 into 0).

    Input

    The input contains two integers n (1 ≤ n ≤ ) and i separated by a space. It’s guaranteed that i is smaller than the length of the binary representation of n.

    Output

    The program should print the resulting number after toggling the i-th bit of n.

    Examples

    Input
    Output
    9 2
    13
    9 3
    1

    Explanation

    • 9 → 1001 ⇒ toggle bit at index 2 ⇒ 1101 ⇒ 13
    • 9 → 1001 ⇒ toggle bit at index 3 ⇒ 0001 ⇒ 1
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

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