Square Sum Given a 5 x 5 grid of integers and a target sum, find whether or not a 2 × 2 square sub-grid exists such that its left LeftdiagonalSum is equal to the target, and the sum of its right RightdiagonalSum is multiple of the target. Then print the position of the top left corner of the square. The LeftdiagonalSum is the sum of the numbers in the left diagonal of the sub-grid. The RightdiagonalSum is the sum of the numbers in the right diagonal of the sub-grid. Below is an example of a grid showing a bolded 2 x 2 square sub-grid that has a LeftdiagonalSum of 12, which is the target sum. The RightdiagonalSum is 60 nad 60 is multiple of 12 (60%12=0).
Square Sum Given a 5 x 5 grid of integers and a target sum, find whether or not a 2 × 2 square sub-grid exists such that its left LeftdiagonalSum is equal to the target, and the sum of its right RightdiagonalSum is multiple of the target. Then print the position of the top left corner of the square. The LeftdiagonalSum is the sum of the numbers in the left diagonal of the sub-grid. The RightdiagonalSum is the sum of the numbers in the right diagonal of the sub-grid. Below is an example of a grid showing a bolded 2 x 2 square sub-grid that has a LeftdiagonalSum of 12, which is the target sum. The RightdiagonalSum is 60 nad 60 is multiple of 12 (60%12=0).
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
The program should be in C++ use #include<iostream> and using namespace std
![Square Sum
Given a 5 x 5 grid of integers and a target sum, find whether or not a 2 x 2 square sub-grid
exists such that its left LeftdiagonalSum is equal to the target, and the sum of its right
RightdiagonalSum is multiple of the target. Then print the position of the top left corner of the
square. The LeftdiagonalSum is the sum of the numbers in the left diagonal of the sub-grid.
The RightdiagonalSum is the sum of the numbers in the right diagonal of the sub-grid.
Below is an example of a grid showing a bolded 2 x 2 square sub-grid that has a
LeftdiagonalSum of 12, which is the target sum. The RightdiagonalSum is 60 nad 60 is
multiple of 12 (60%12=0).
4
45
-5
6
4
-3
11
22
20
47
-7
-29
-9
13
-8
14
-10
21
15
20
-9
Your program must contain and use the following:
A function called printLocation that will print the location of the square that has
a LeftdiagonalSum equals to the target sum and the RightdiagonalSum is multiple of
target sum, in terms of the coordinates of the top left number. This function will be
called from the main function.
void printLocation (int numbers [] [5], int size, int targetSum);
Input:
Each of the first 5 lines of the input contains 5 integers separated by a single whitespace.
After these first 5 lines, a line follows that contains a positive integer N representing the
number of target sums to be searched in the grid. Next, N lines follow, each containing an
integer representing the target sum to be searched for in the grid.
Output:
The output must contain N lines. Each line contains a string in the following format (without
quotes):
“<TARGET> found at (<R>, <C>)."
where <TARGET> is the target sum, and <R> and <C> are the row and column indices,
respectively, of the top left integer of the square. In case a square was not found, the line must
instead be:
"<TARGET> not found."
Sample outputs (user input is indicated as bold):
6.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff3d5236c-1d8b-4ff2-8138-a2c53e11db7b%2F6d5cda65-8871-4901-934c-5ada7c5f5e1e%2Fn4x8xvld_processed.png&w=3840&q=75)
Transcribed Image Text:Square Sum
Given a 5 x 5 grid of integers and a target sum, find whether or not a 2 x 2 square sub-grid
exists such that its left LeftdiagonalSum is equal to the target, and the sum of its right
RightdiagonalSum is multiple of the target. Then print the position of the top left corner of the
square. The LeftdiagonalSum is the sum of the numbers in the left diagonal of the sub-grid.
The RightdiagonalSum is the sum of the numbers in the right diagonal of the sub-grid.
Below is an example of a grid showing a bolded 2 x 2 square sub-grid that has a
LeftdiagonalSum of 12, which is the target sum. The RightdiagonalSum is 60 nad 60 is
multiple of 12 (60%12=0).
4
45
-5
6
4
-3
11
22
20
47
-7
-29
-9
13
-8
14
-10
21
15
20
-9
Your program must contain and use the following:
A function called printLocation that will print the location of the square that has
a LeftdiagonalSum equals to the target sum and the RightdiagonalSum is multiple of
target sum, in terms of the coordinates of the top left number. This function will be
called from the main function.
void printLocation (int numbers [] [5], int size, int targetSum);
Input:
Each of the first 5 lines of the input contains 5 integers separated by a single whitespace.
After these first 5 lines, a line follows that contains a positive integer N representing the
number of target sums to be searched in the grid. Next, N lines follow, each containing an
integer representing the target sum to be searched for in the grid.
Output:
The output must contain N lines. Each line contains a string in the following format (without
quotes):
“<TARGET> found at (<R>, <C>)."
where <TARGET> is the target sum, and <R> and <C> are the row and column indices,
respectively, of the top left integer of the square. In case a square was not found, the line must
instead be:
"<TARGET> not found."
Sample outputs (user input is indicated as bold):
6.
![Note: the last test case is the last two digits of your ID, for example if your Id is
100054128, then the target sum is 28]
1 4 45 -5 0
6 4 6 5 -3
11 22 20 47 -7
-29 -9 13 -8 14
-10 21 15 20 -9
5
5 found at (0, 0).
10
10 not found.
12
12 found at (2, 2).
-17
-17 found at (3, 3).
-1
-1 not found.
[Last two digits of your ID], this test case ID=28
28 not found.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff3d5236c-1d8b-4ff2-8138-a2c53e11db7b%2F6d5cda65-8871-4901-934c-5ada7c5f5e1e%2Fg6cev9n_processed.png&w=3840&q=75)
Transcribed Image Text:Note: the last test case is the last two digits of your ID, for example if your Id is
100054128, then the target sum is 28]
1 4 45 -5 0
6 4 6 5 -3
11 22 20 47 -7
-29 -9 13 -8 14
-10 21 15 20 -9
5
5 found at (0, 0).
10
10 not found.
12
12 found at (2, 2).
-17
-17 found at (3, 3).
-1
-1 not found.
[Last two digits of your ID], this test case ID=28
28 not found.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY