HELP! I have a problem with a program I$$m working on$.$ My program outputs incorrect paths and it doesn$$t output the expected result. For example, when I input $./$a$.$out $21235$ it should output:

$$NNENE

NNEEN

NENNE

NENEN

NEENN

ENNEN

ENENN

Number of paths: $7$

But instead it outputs:

$$Paths:

Number of paths: $0$

Here$$s my code:

greedy$\_$robot.h

#ifndef GREEDY$\_$ROBOT$\_$H

#define GREEDY$\_$ROBOT$\_$H

#include

#include

$//$ Function to generate paths from current position to treasure

void generatePaths$($int max$\_$distance, int robot$\_$x$,$ int robot$\_$y$,$ int treasure$\_$x$,$ int treasure$\_$y$,$

std::string pathSoFar, std::vector& result$)$;

$//$ Function to find paths from starting position to treasure

std::vector findPaths$($int max$\_$distance, int robot$\_$x$,$ int robot$\_$y$,$ int treasure$\_$x$,$ int treasure$\_$y$)$;

#endif $//$ GREEDY$\_$ROBOT$\_$H

greedy$\_$robot.cpp

#include

#include "greedy$\_$robot.h$"$

using namespace std;

void generatePaths$($int max$\_$distance, int robot$\_$x$,$ int robot$\_$y$,$ int treasure$\_$x$,$ int treasure$\_$y$,$

std::string pathSoFar, std::vector& result$)\{$

$//$ Base case: you've reached the treasure with the required distance

if $($robot$\_$x $==$ treasure$\_$x && robot$\_$y $==$ treasure$\_$y && pathSoFar.length$()==2*$ max$\_$distance$)\{$

result.push$\_$back$($pathSoFar$)$;

return;

$\}$

$//$ Move East if robot's x$-$coordinate is less than treasure's x$-$coordinate

if $($robot$\_$x $<$ treasure$\_$x && pathSoFar.length$()<2*$ max$\_$distance$)\{$

generatePaths$($max$\_$distance, robot$\_$x $+1,$ robot$\_$y$,$ treasure$\_$x$,$ treasure$\_$y$,$ pathSoFar $+\text{'}$E$\text{'},$ result$)$;

$\}$

$//$ Move West if robot's x$-$coordinate is greater than treasure's x$-$coordinate

if $($robot$\_$x $>$ treasure$\_$x && pathSoFar.length$()<2*$ max$\_$distance$)\{$

generatePaths$($max$\_$distance, robot$\_$x $-1,$ robot$\_$y$,$ treasure$\_$x$,$ treasure$\_$y$,$ pathSoFar $+\text{'}$W$\text{'},$ result$)$;

$\}$

$//$ Move North if robot's y$-$coordinate is less than treasure's y$-$coordinate

if $($robot$\_$y $<$ treasure$\_$y && pathSoFar.length$()<2*$ max$\_$distance$)\{$

generatePaths$($max$\_$distance, robot$\_$x$,$ robot$\_$y $+1,$ treasure$\_$x$,$ treasure$\_$y$,$ pathSoFar $+\text{'}$N$\text{'},$ result$)$;

$\}$

$//$ Move South if robot's y$-$coordinate is greater than treasure's y$-$coordinate

if $($robot$\_$y $>$ treasure$\_$y && pathSoFar.length$()<2*$ max$\_$distance$)\{$

generatePaths$($max$\_$distance, robot$\_$x$,$ robot$\_$y $-1,$ treasure$\_$x$,$ treasure$\_$y$,$ pathSoFar $+\text{'}$S$\text{'},$ result$)$;

$\}$

$\}$

std::vector findPaths$($int max$\_$distance, int robot$\_$x$,$ int robot$\_$y$,$ int treasure$\_$x$,$ int treasure$\_$y$)\{$

std::vector result;

generatePaths$($max$\_$distance, robot$\_$x$,$ robot$\_$y$,$ treasure$\_$x$,$ treasure$\_$y$,"",$ result$)$;

return result;

$\}$

main.cpp

#include

#include "greedy$\_$robot.h$"$

using namespace std;

int main$($int argc, char$*$ argv$[])\{$

$//$ Check if correct number of command$-$line arguments is provided

if $($argc $!=6)\{$

cerr $<<$ "Usage: $"<<$ argv$[0]<<"$ max$\_$distance robot$\_$x robot$\_$y treasure$\_$x treasure$\_$y

$"$;

return $1$;

$\}$

$//$ Convert command$-$line arguments to integers

int max$\_$distance $=$ stoi$($argv$[1])$;

int robot$\_$x $=$ stoi$($argv$[2])$;

int robot$\_$y $=$ stoi$($argv$[3])$;

int treasure$\_$x $=$ stoi$($argv$[4])$;

int treasure$\_$y $=$ stoi$($argv$[5])$;

$//$ Find paths from starting position to treasure

vector paths $=$ findPaths$($max$\_$distance, robot$\_$x$,$ robot$\_$y$,$ treasure$\_$x$,$ treasure$\_$y$)$;

$//$ Print the paths and number of paths

cout $<<$ "Paths:

$"$;

for $($const auto& path : paths$)\{$

cout $<<$ path $<<\text{'}$

$\text{'}$;

$\}$

cout $<<$ "Number of paths: $"<<$ paths.size$()<<\text{'}$

$\text{'}$;

return $0$;

$\}$