gers 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 × 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). 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
c++
Square Sum
Given a 5 × 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 × 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).
|
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 |
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
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.”
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
