You are currently at cell (1, 1) of an N X M grid. There is a rule that decides how you can move in the grid to reach the position (N, M). The rule is, that if you are at cell (x, y) then from there you can either move to cell (x, x+y) or to cell (x+y, y) in one step. Your task is to find the minimum number of steps that you must take to reach cell (N, M) starting from current position i.e. (1, 1) Note: If it is not possible to reach (N, M) from (1, 1), then return-1 as your output. Input Specification: input1: An integer value representing the value of N where 1<=N input2: An integer value representing the value of M where M< 106 Output Specification: Return the minimum number of steps. Example 1: input1: 3 input2: 2 Output: 2

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Please code the below question in any one of these languages C or C++ or Java6 or python2 or Java 7 or Python 3 or PHP or Go or R ( Any one of these)
Example 1:
input1: 3
input2: 2
Output: 2
Explanation:
(1, 1) –> (1, 2) -> (3, 2)
The number of steps involved are 2 only. Therefore, 2 will be returned as the
output
Example 2:
input1: 2
input2: 2
Output: -1
Explanation:
As it is not possible to reach (2, 2) from (1, 1), hence -1 is returned as the
output.
Transcribed Image Text:Example 1: input1: 3 input2: 2 Output: 2 Explanation: (1, 1) –> (1, 2) -> (3, 2) The number of steps involved are 2 only. Therefore, 2 will be returned as the output Example 2: input1: 2 input2: 2 Output: -1 Explanation: As it is not possible to reach (2, 2) from (1, 1), hence -1 is returned as the output.
You are currently at cell (1, 1) of an N X M grid. There is a rule that decides
how you can move in the grid to reach the position (N, M). The rule is, that if
you are at cell (x, y) then from there you can either move to cell (x, x+y) or to
cell (x+y, y) in one step.
Your task is to find the minimum number of steps that you must take to reach
cell (N, M) starting from current position i.e. (1,1)
Note: If it is not possible to reach (N, M) from (1, 1), then return -1 as your output.
Input Specification:
input1: An integer value representing the value of N where 1<=N
input2: An integer value representing the value of M where M< 106
Output Specification:
Return the minimum number of steps.
Example 1:
input1: 3
input2: 2
Output: 2
Transcribed Image Text:You are currently at cell (1, 1) of an N X M grid. There is a rule that decides how you can move in the grid to reach the position (N, M). The rule is, that if you are at cell (x, y) then from there you can either move to cell (x, x+y) or to cell (x+y, y) in one step. Your task is to find the minimum number of steps that you must take to reach cell (N, M) starting from current position i.e. (1,1) Note: If it is not possible to reach (N, M) from (1, 1), then return -1 as your output. Input Specification: input1: An integer value representing the value of N where 1<=N input2: An integer value representing the value of M where M< 106 Output Specification: Return the minimum number of steps. Example 1: input1: 3 input2: 2 Output: 2
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY