import [Link].

*;
class Transpose {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter number of rows: ");
int r = [Link]();
[Link]("Enter number of columns: ");
int c = [Link]();
int arr[][] = new int[r][c];

[Link]("Enter elements:");
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
arr[i][j] = [Link]();
}
}

[Link]("Transpose:");
for (int i = 0; i < c; i++) {
for (int j = 0; j < r; j++) {
[Link](arr[j][i] + " ");
}
[Link]();
}
}
}

import [Link].*;
class SymmetricCheck {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size of square matrix: ");
int n = [Link]();
int arr[][] = new int[n][n];

[Link]("Enter elements:");
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
arr[i][j] = [Link]();
}
}

boolean symmetric = true;

 for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (arr[i][j] != arr[j][i]) {
symmetric = false;
break;
}
}
if (!symmetric) break;
}

if (symmetric)
[Link]("The matrix is Symmetric.");
else
[Link]("The matrix is NOT Symmetric.");
}
}

import [Link].*;
class DiagonalSum {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
int m[][] = new int[4][4]; // fixed 4x4 matrix like in book
[Link]("Enter 16 elements:");
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
m[i][j] = [Link]();
}
}

int ld = 0, rd = 0;

// Left diagonal
for (int i = 0; i < 4; i++) {
ld += m[i][i];
}

// Right diagonal with k = 3

int k = 3; // hardcoded for 4x4 matrix
for (int i = 0; i < 4; i++) {
rd += m[i][k];
k--;
}
 [Link]("Left Diagonal Sum: " + ld);
[Link]("Right Diagonal Sum: " + rd);
}
}

import [Link].*;
class RowColSum {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter number of rows: ");
int r = [Link]();
[Link]("Enter number of columns: ");
int c = [Link]();
int arr[][] = new int[r][c];

[Link]("Enter the elements:");

for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
arr[i][j] = [Link]();
}
}

// Row sums
[Link]("\nSum of each row:");
for (int i = 0; i < r; i++) {
int rowSum = 0;
for (int j = 0; j < c; j++) {
rowSum += arr[i][j]; // row fixed, loop through columns
}
[Link]("Row " + (i + 1) + ": " + rowSum);
}

// Column sums (note the swapped indices)

[Link]("\nSum of each column:");
for (int i = 0; i < c; i++) { // now i = column index
int colSum = 0;
for (int j = 0; j < r; j++) { // j = row index
colSum += arr[j][i]; // accessing by [row][column]
}
[Link]("Column " + (i + 1) + ": " + colSum);
}
 }
}

import [Link].*;
class ReverseArray {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter number of elements:");
int n = [Link]();
int arr[] = new int[n];
[Link]("Enter " + n + " numbers:");
for (int i = 0; i < n; i++)
arr[i] = [Link]();

[Link]("Array in reverse order:");

for (int i = n - 1; i >= 0; i--)
[Link](arr[i] + " ");
}
}

import [Link].*;
class SortArray {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter number of elements:");
int n = [Link]();
int arr[] = new int[n];
[Link]("Enter " + n + " numbers:");
for (int i = 0; i < n; i++)
arr[i] = [Link]();
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (arr[i] > arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
[Link]("Sorted array:");
 for (int i = 0; i < n; i++)
[Link](arr[i] + " ");
}
}

import [Link].*;
class EvenOddCount {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter number of elements:");
int n = [Link]();
int arr[] = new int[n];
int even = 0, odd = 0;
[Link]("Enter " + n + " numbers:");
for (int i = 0; i < n; i++) {
arr[i] = [Link]();
if (arr[i] % 2 == 0) even++;
else odd++;
}
[Link]("Even count: " + even);
[Link]("Odd count: " + odd);
}
}

import [Link].*;
class LargestSmallest {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter number of elements:");
int n = [Link]();
int arr[] = new int[n];
[Link]("Enter " + n + " numbers:");
for (int i = 0; i < n; i++)
arr[i] = [Link]();
int max = arr[0], min = arr[0];
for (int i = 1; i < n; i++) {
if (arr[i] > max) max = arr[i];
if (arr[i] < min) min = arr[i];
}
[Link]("Largest: " + max);
 [Link]("Smallest: " + min);
}
}

import [Link].*;
class SearchArray {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter number of elements:");
int n = [Link]();
int arr[] = new int[n];
[Link]("Enter " + n + " numbers:");
for (int i = 0; i < n; i++)
arr[i] = [Link]();
[Link]("Enter number to search:");
int key = [Link]();
boolean found = false;
for (int i = 0; i < n; i++) {
if (arr[i] == key) {
found = true;
break;
}
}
if (found)
[Link]("Element found.");
else
[Link]("Element not found.");
}
}

import [Link].*;
class ArraySum {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter number of elements:");
int n = [Link]();
int arr[] = new int[n];
[Link]("Enter " + n + " numbers:");
int sum = 0;
for (int i = 0; i < n; i++) {
arr[i] = [Link]();
 sum += arr[i];
}
[Link]("Sum of elements: " + sum);
}
}