Now a days, we are surrounded by lies all the time. But if we look close enough, we will always find exactly one truth for each matter. In this task, we will try to put that truth in the middle. Let's say we have a n x n matrix (n> 1 and must be an odd number), consisting of n^2 - 1 false statements and a single true statement. Let's index the matrix rows by numbers from 1 to n from top to bottom, let's index the matrix columns by numbers from 1 to n from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix: • Swap two neighboring rows, that is, rows with indexes i and i + 1 for some integer i (1 ≤i

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

Can you please help me this question in Java? 

Now a days, we are surrounded by lies all the time. But if we look close enough, we will always find
exactly one truth for each matter. In this task, we will try to put that truth in the middle.
Let's say we have a n x n matrix (n> 1 and must be an odd number), consisting of n^2 - 1 false
statements and a single true statement. Let's index the matrix rows by numbers from 1 to n from
top to bottom, let's index the matrix columns by numbers from 1 to n from left to right. In one
move, you are allowed to apply one of the two following transformations to the matrix:
Swap two neighboring rows, that is, rows with indexes i and i + 1 for some integer i (1 ≤ i <n).
• Swap two neighboring columns, that is, columns with indexes j and j + 1 for some integer j (1 ≤
j<n).
Let's look for the true statement and put it in the middle of the matrix. For example, if n =5, then we
need to put the true value in the cell that is on the intersection of the third row and the third
column. Your task is to count the minimum number of moves needed to put the true statement in
the middle of the matrix.
●
Input:
Dimension of the matrix, n.
The input consists of n lines, each line contains n characters, either F or T.
Output:
Print a single integer - the minimum number of moves needed to put the truth in the middle (i.e. the
distance between the truth and the middle of the matrix).
n must be greater than 1 and an odd number. If not, return "Invalid size of the matrix"
There must be exactly one T in the matrix. If not, return "Error! Exactly one truth please"
Sample Input1:
5
FFFFF
FF FF T
FFFFF
FFFFF
FFFFF
Sample output1:
3
Transcribed Image Text:Now a days, we are surrounded by lies all the time. But if we look close enough, we will always find exactly one truth for each matter. In this task, we will try to put that truth in the middle. Let's say we have a n x n matrix (n> 1 and must be an odd number), consisting of n^2 - 1 false statements and a single true statement. Let's index the matrix rows by numbers from 1 to n from top to bottom, let's index the matrix columns by numbers from 1 to n from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix: Swap two neighboring rows, that is, rows with indexes i and i + 1 for some integer i (1 ≤ i <n). • Swap two neighboring columns, that is, columns with indexes j and j + 1 for some integer j (1 ≤ j<n). Let's look for the true statement and put it in the middle of the matrix. For example, if n =5, then we need to put the true value in the cell that is on the intersection of the third row and the third column. Your task is to count the minimum number of moves needed to put the true statement in the middle of the matrix. ● Input: Dimension of the matrix, n. The input consists of n lines, each line contains n characters, either F or T. Output: Print a single integer - the minimum number of moves needed to put the truth in the middle (i.e. the distance between the truth and the middle of the matrix). n must be greater than 1 and an odd number. If not, return "Invalid size of the matrix" There must be exactly one T in the matrix. If not, return "Error! Exactly one truth please" Sample Input1: 5 FFFFF FF FF T FFFFF FFFFF FFFFF Sample output1: 3
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

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