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

    • The number of grid points on a segment

    Given a segment connecting and , you are asked to calculate the number of grid points (points with integer coordinates) the line crosses.
    When calculating the number of grid points, you should exclude the coordinate from the answer.
     
    notion image

    Input

    The only line of the input contains two integers x and y (1 ≤ x, y ≤ ).

    Output

    The program should print the number of grid points the line crosses.

    Examples

    Input
    Output
    8 12
    4
    12 8
    4
     

    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