JPNav is a program to help navigate people, telling them wether or not they can reach their destination. You as a future programmer is chosen to make this program! 1. J represents a people. This will be the start point. 2. P represents the destination. This will be the end point. 3. . represents normal tile. 4. # represents unpassable wall. Input The first line of input is an integer N, which determines the width and the height of the map. The next input will be lines as many as N, which contain N number of characters, describing the map. Constraint 1

Microsoft Visual C#
7th Edition
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Joyce, Farrell.
Chapter4: Making Decisions
Section: Chapter Questions
Problem 7E: Write a program named GuessingGame that generates a random number between 1 and 10. (In other words,...
icon
Related questions
Question

algorithm and programming

Program Use the language C
JPNAV is a program to help navigate people, telling them wether or not they can reach their
destination. You as a future programmer is chosen to make this program!
1. J represents a people. This will be the start point.
2. P represents the destination. This will be the end point.
3.
. represents normal tile.
4. # represents unpassable wall.
Input
The first line of input is an integer N, which determines the width and the height of the map.
The next input will be lines as many as N, which contain N number of characters, describing the map.
Constraint
1<N< 1000
Output
Print "J found its way to P." if J could reach P.
Printf “J couldn't find its way to P." if J could not reach P.
Transcribed Image Text:JPNAV is a program to help navigate people, telling them wether or not they can reach their destination. You as a future programmer is chosen to make this program! 1. J represents a people. This will be the start point. 2. P represents the destination. This will be the end point. 3. . represents normal tile. 4. # represents unpassable wall. Input The first line of input is an integer N, which determines the width and the height of the map. The next input will be lines as many as N, which contain N number of characters, describing the map. Constraint 1<N< 1000 Output Print "J found its way to P." if J could reach P. Printf “J couldn't find its way to P." if J could not reach P.
Input
Output
J couldn't find its way to P.
#####
J.
#####
#P..#
#####
3
J couldn't find its way to P.
i..
###
J found its way to P.
#####
J.
#:
##. ##
#P..#
#####
Transcribed Image Text:Input Output J couldn't find its way to P. ##### J. ##### #P..# ##### 3 J couldn't find its way to P. i.. ### J found its way to P. ##### J. #: ##. ## #P..# #####
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Microsoft Visual C#
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr