Write in C language not Java Description Give you a 2-D array represent a maze, in this maze, 1 is wall and is a space you can walk on. You can move 4 direction, up, down, left and right. Write a program to see if a maze has a way from start to the end. Input First line of input will be a integer number represent size of the maze. Follow by n rows and n columns every row. In the maze, left top is the start and right button is end. Output if there is a way from start to the end then print "Yes", print "No" if not. Sample Input 1 5 0 0 0 0 0 1 1 1 1 0 eeeee 0 1 1 1 1 0 0 0 0 0 Sample Output 1 Yes Sample Input 2 5 0 0 0 0 0 1 1 1 1 0 00100 01111 0 0 0 0 0 Sample Output 2 No

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

code it

Write in C language not Java
Description
Give you a 2-D array represent a maze, in this maze, 1 is wall and is a space you can walk on. You can move 4 direction, up, down, left and right.
Write a program to see if a maze has a way from start to the end.
Input
First line of input will be a integer number represent size of the maze. Follow by n rows and n columns every row. In the maze, left top is the start and right button is end.
Output
if there is a way from start to the end then print "Yes", print "No" if not.
Sample Input 1
5
0 0 0 0 0
1 1 1 1 0
0 0 0 0 0
0 1 1 1 1
0 0 0 0 0
Sample Output 1
Yes
Sample Input 2
5
0 0 0 0 0
1 1 1 1 0
0 0 1 0 0
0 1 1 1 1
0 0 0 0 0
Sample Output 2
No
Transcribed Image Text:Write in C language not Java Description Give you a 2-D array represent a maze, in this maze, 1 is wall and is a space you can walk on. You can move 4 direction, up, down, left and right. Write a program to see if a maze has a way from start to the end. Input First line of input will be a integer number represent size of the maze. Follow by n rows and n columns every row. In the maze, left top is the start and right button is end. Output if there is a way from start to the end then print "Yes", print "No" if not. Sample Input 1 5 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 Sample Output 1 Yes Sample Input 2 5 0 0 0 0 0 1 1 1 1 0 0 0 1 0 0 0 1 1 1 1 0 0 0 0 0 Sample Output 2 No
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Arrays
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
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