Given a 2D binary matrix filled with O's and 1's, find the largest square containing all 1's and return its area. For example, given the following matrix: 10100 10111 11111 10010 Return 4. Input Your program takes as input a file with multiple test cases separated by an empty line. Each test case starts with a line with two integers indicating the size of the matrix in the test case, and is followed by lines of 0's and 1's that form the matrix. The last line is a 0 meaning the end of test cases. A sample input is as follows: 45 10100 10111 11111 10010 57 101001 1011111 1111101 1011101 1010101 e Output Your program should output the area for the largest square of each test case in console. The correct output for the above test cases are: 9 Hint

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

Use C++ coding language and provide a code that works properly 

input.txt

4 5
1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
5 7
1 0 1 0 0 1 1
1 0 1 1 1 1 1
1 1 1 1 1 0 1
1 0 1 1 1 0 1
1 0 1 0 1 0 1
0

EUTEL
Given a 2D binary matrix filled with O's and 1's, find the largest square containing all 1's and return its area.
For example, given the following matrix:
10100
10111
11111
100 10
Return 4.
Input
Your program takes as input a file with multiple test cases separated by an empty line. Each test case start
with a line with two integers indicating the size of the matrix in the test case, and is followed by lines of 0's
and 1's that form the matrix. The last line is a O meaning the end of test cases.
A sample input is as follows:
45
10100
E
ww
11001
Per
57
1010011
101111
1111
101
S
10
Output
Your program should output the area for the largest square of each test case in console.
The correct output for the above test cases are:
Hint
MASINI
Al
ly
SEEEEEE
W
J
• What is the objective function? Let's use f[i][j] - the side length of the largest square in matrix N[*]
[5] - How would you setup a recurrence relation then?
Happy coding!
Transcribed Image Text:EUTEL Given a 2D binary matrix filled with O's and 1's, find the largest square containing all 1's and return its area. For example, given the following matrix: 10100 10111 11111 100 10 Return 4. Input Your program takes as input a file with multiple test cases separated by an empty line. Each test case start with a line with two integers indicating the size of the matrix in the test case, and is followed by lines of 0's and 1's that form the matrix. The last line is a O meaning the end of test cases. A sample input is as follows: 45 10100 E ww 11001 Per 57 1010011 101111 1111 101 S 10 Output Your program should output the area for the largest square of each test case in console. The correct output for the above test cases are: Hint MASINI Al ly SEEEEEE W J • What is the objective function? Let's use f[i][j] - the side length of the largest square in matrix N[*] [5] - How would you setup a recurrence relation then? Happy coding!
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Constants and Variables
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