Docking in c# with x and y parameter...

Problem Statement: - This problem is about finding a shortest distance between two points. Ask
user to enter a number N. Then you have to create a space with NxN dimensions. User then will
enter coordinates for two points in this NxN space and you have to find the minimum number of
steps you need to get from one point to another. The steps are always unit steps. Your program
should output the number of steps needed and also sequence of steps required for one of the
possible shortest path.
An Example: - Suppose that user enters N as 2, then you have a 2-dimensional space as shown in
the figure below.
Now if user enters two points as (2,2) and (4,4) then taking one unit step at a time, one possible
solution is shown in the figure. So the output showing the sequence of steps is (4,4) to (4,3), (4,3) to
(4,2), (4,2,) to (3,2), (3,2) to (2,2). Which are 4 steps in total. The same thing can be done for 3-
dimensional and can be extended to N-dimensions.

Try this:

using System;

class Program

{

static void Main()

{

Console.Write("Enter number of dimensions : ");

int N = int.Parse(Console.ReadLine());

int[] p = new int[N];

int[] q = new int[N];

int[] t = new int[N];

Console.WriteLine("\nEnter co-ordinates of first point\n");

GetPoint(p);

Console.WriteLine("\n\nEnter co-ordinates of second point\n");

GetPoint(q);

bool isSame = true;

for(int i = 0; i < N; i++)

{

if (p[i] != q[i])

{

isSame = false;

break;

}

if(isSame)

{

Console.WriteLine("\nThe points are the same so no steps are needed");

return;

}

for(int i = 0; i < N; i++) t[i] = p[i];

Console.WriteLine("\n\nThe steps required are\n");

int count = 0;

for(int i = 0; i < N; i++)

{

if (p[i] < q[i])

{

for(int j = p[i] + 1; j <= q[i]; j++)

{

PrintPoint(t);

Console.Write(" to ");

t[i] = j;

PrintPoint(t);

Console.WriteLine();

count++;

}

else if (p[i] > q[i])

{

for(int j = p[i] - 1; j >= q[i]; j--)

{

PrintPoint(t);

Console.Write(" to ");

t[i] = j;

PrintPoint(t);

Console.WriteLine();

count++;

}

Console.WriteLine("\nThe minimum number of steps is {0}", count);

Console.ReadKey();

}

static void GetPoint(int[] a)

{

for(int i = 0; i < a.Length; i++)

{

Console.Write(" Dimension {0} : ", i + 1);

a[i] = int.Parse(Console.ReadLine());

}

static void PrintPoint(int[] a)

{

Console.Write("(");

for(int i = 0; i < a.Length; i++)

{

if (i == a.Length - 1)

{

Console.Write("{0})", a[i]);

}

else

{

Console.Write("{0},", a[i]);

}

1 Reply

Know the answer? Post it — somebody with the same question will find it here.

Vulpes13y ago
Try this:

using System;

class Program
{
static void Main()
{
Console.Write("Enter number of dimensions : ");
int N = int.Parse(Console.ReadLine());
int[] p = new int[N];
int[] q = new int[N];
int[] t = new int[N];

Console.WriteLine("\nEnter co-ordinates of first point\n");
GetPoint(p);
Console.WriteLine("\n\nEnter co-ordinates of second point\n");
GetPoint(q);

bool isSame = true;
for(int i = 0; i < N; i++)
{
if (p[i] != q[i])
{
isSame = false;
break;
}
}

if(isSame)
{
Console.WriteLine("\nThe points are the same so no steps are needed");
return;
}

for(int i = 0; i < N; i++) t[i] = p[i];

Console.WriteLine("\n\nThe steps required are\n");
int count = 0;

for(int i = 0; i < N; i++)
{
if (p[i] < q[i])
{
for(int j = p[i] + 1; j <= q[i]; j++)
{
PrintPoint(t);
Console.Write(" to ");
t[i] = j;
PrintPoint(t);
Console.WriteLine();
count++;
}
}
else if (p[i] > q[i])
{
for(int j = p[i] - 1; j >= q[i]; j--)
{
PrintPoint(t);
Console.Write(" to ");
t[i] = j;
PrintPoint(t);
Console.WriteLine();
count++;
}
}
}

Console.WriteLine("\nThe minimum number of steps is {0}", count);
Console.ReadKey();
}

static void GetPoint(int[] a)
{
for(int i = 0; i < a.Length; i++)
{
Console.Write(" Dimension {0} : ", i + 1);
a[i] = int.Parse(Console.ReadLine());
}
}

static void PrintPoint(int[] a)
{
Console.Write("(");
for(int i = 0; i < a.Length; i++)
{
if (i == a.Length - 1)
{
Console.Write("{0})", a[i]);
}
else
{
Console.Write("{0},", a[i]);
}
}
}
}