Interested to Buy Any Domain ? << Click Here >> for more details...
There is a magic square matrix in such a way that sum of a
column or a row are same like
3 5 2
4 3 3
3 2 5
sum of each column and row is 10.
you have to check that matrix is magic matrix or not?
- 1 Answers
- 5915 Views
- TCS, I also Faced
- E-Mail Answers
Answer / hussein
public class MagicSquares {
public static void main(String[] args) {
int magic[][] = { { 3, 5, 2}, { 4, 3, 3}, { 3, 2, 5};
int total = 0, sum, sum1;
for (int r = 0; r < 3; ++r) {
for (int c = 0; c < 3; ++c) {
total += magic[r][c];
if (magic[r][c] < 10)
System.out.print(" " + magic[r][c]);
else
System.out.print(" " + magic[r][c]);
}
System.out.println();
}
int sumrow[] = new int[4];
for (int c = 0; c < 4; ++c)
sumrow[c] = 0;
for (int row = 0; row < 4; row++)
for (int c = 0; c < 4; ++c)
sumrow[row] += magic[row][c];
int sumcol[] = new int[4];
for (int c = 0; c < 4; ++c)
sumcol[c] = 0;
for (int col = 0; col < 4; col++)
for (int r = 0; r < 4; ++r)
sumcol[col] += magic[r][col];
int sumdiag[] = new int[2];
for (int diag = 0; diag < 4; diag++)
sumdiag[0] += magic[diag][diag];
for (int diag = 0; diag < 4; ++diag)
sumdiag[1] += magic[3 - diag][diag];
sum = total / 4;
sum1 = (sum + ((sumdiag[0] + sumdiag[1]) / 2)) / 2;
if (sum1 == sum)
System.out.println("This is a magic square!");
else
System.out.println("This is not a magic square!");
}
| Is This Answer Correct ? | 7 Yes | 0 No |
C++ program output? Explain output of this program. #include <iostream> using std::cout; using std::cin; int main() { cout<<cout<<' '; cout<<cin; return 0; } It prints some address in hexadecimal. what is it?
Why can you not make a constructor as const?
What is ios flag in c++?
Can a built-in function be recursive?
How many types of casting are there in C++? When is a dynamic cast,static_cast,reinterpret cast used?
How do you define/declare constants in c++?
Have you used MSVC? What do you think of it?
Write a program that takes a 5 digit number and calculates 2 power that number and prints it.
Explain the static storage classes in c++.
How do you traverse a btree in backward in-order?
Write a c++ code that will calculate the roots of a quadratic equation a2+ bx+c=0 Hint: d = sqrt (b2-4ac), and the roots are: x1 = (€“b + d)/2a and x2 = (€“b €“ d)/2a (use sqrt function from cmath.h )?
How to declare a pointer to an array of integers?
STL 
