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

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
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.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education