Algorithm for - can reach from one point(a, b) to other (C, d).

Question

0.00/5 (No votes)

See more:

C#

What would be the algorithm for following question- 
If you are given input(a,b) is it possible to reach(c,d) i.e from (a,b) you can go (a+b,b) or (a,a+b) n number of times .Answers should be in ‘yes’ or ‘No’.
 eg- i.e if ur (a,b) is -(1,4) it can move to (5,4)==>> (5,9)==>>(5,14) and so on. 
Java Syntax-
 String is Possible(int a, int b, int c, int d). { }

What I have tried:

I think graph will help , but I am not sure about it .

Posted 25-Sep-16 6:47am

Member 11846821

Updated 25-Sep-16 11:47am

Add a Solution

Comments

[no name] 25-Sep-16 13:46pm

That depends. What were you studying in class when you got this homework assignment?

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CarelAgain · Answer 1 · 2016-09-25T08:03:00

(x0, y0) can reach (x1, y1) if x0 can reach x1 and y0 can reach y1, assuming x0 <= x1 and y0 <= y1, then using bool to indicate whether (x0, y0) can reach (x1, y1) the following might do it

C#

using System;

namespace CanReach
{
    internal class Program
    {
        public static int CanReachOne(int x, int y, int tx)
        {
            int f = 0;
            while (x < tx)
            {
                x += y;
                f++;
            }
            return x == tx ? f : -1;
        }

        public static bool CanReach(int a, int b, int c, int d)
        {
            int aCan = CanReachOne(a, b, c);
            int bCan = CanReachOne(b, a, d);
            return aCan > -1 && bCan > -1;
        }

        private static void Main(string[] args)
        {

            Console.WriteLine("({0},{1}) => ({2},{3}) = {4}", 1, 4, 5, 14, 
                              CanReach(1, 4, 5, 14));
            Console.ReadLine();
        }
    }
}

Patrice T · Answer 2 · 2016-09-25T11:47:00

We do not do your HomeWork.
HomeWork is not set to test your skills at begging other people to do your work, it is set to help your teacher to check your understanding of the courses you have taken and also the problems you have at applying them.
Any failure of you will help your teacher spot your weaknesses and set remedial actions.
So, give it a try, reread your lessons and start working. If you are stuck on a specific problem, show your code and explain this exact problem, we might help.

Quote:
I think graph will help , but I am not sure about it .

If a graph can help, you should know why, otherwise it is a guess.
Look at the statements: you are in map at coordinates (a,b) and you need to reach coordinates (c,d) on each steps, you are only allowed 2 moves. Try to put this together.

For testing purpose, try to go from (1,2) to (8,13)
The path is (1,2) => (3,2) => (3,5) => (8,5) => (8,13)

Algorithm for - can reach from one point(a, b) to other (C, d).

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0