/**

* @(#)Liwaliwj_list.java

* Liwaliwj_list application

* @author

* @version 1.00 2021/9/15

*/

import java.util.*;

public class Liwaliwj_list {

public static void main(String[] args) {

int[][] a=new int[5][5];

initArray(a, 10, 50);

System.out.println("Output the array Elements");

printElements(a);

System.out.println();

System.out.println("Output the sum of prime numbers in array");

sumPrime(a);

System.out.println();

System.out.println("Output the elements in main diagonal");

mainDiagonal(a);

System.out.println();
 System.out.println("Output the sum of the elements below diagonal");

sumBelowDiagonal(a);

System.out.println();

System.out.println("Output the sum of the elements above diagonal");

sumAboveDiagonal(a);

System.out.println();

System.out.println("Output the odd elements below diagonal");

oddBelowDiagonal(a);

System.out.println();

System.out.println("Output the even elements above diagonal");

evenAboveDiagonal(a);

System.out.println();

static void initArray(int[][] a,int min,int max) {

Random rand = new Random();

for(int k=0;k<a.length;k++) {

for(int d=0;d<a[k].length;d++)

a[k][d]=min + (rand.nextInt(Integer.MAX_VALUE) % ((max-min)+1));

static void printElements(int[][] a) {

for(int k=0;k<a.length;k++) {
 for(int d=0;d<a[k].length;d++)

System.out.printf("%2d\t", a[k][d]);

System.out.println();

static boolean isPrime(int num) {

double sqroot = Math.sqrt(num*1.0);

for(int k=2;k<=sqroot;k++) {

if(num%k==0)

return false;

return true;

static void sumPrime(int[][] a) {

int sum=0;

for(int k=0;k<a.length;k++) {

for(int d=0;d<a[k].length;d++)

if(isPrime(a[k][d]))

sum+=a[k][d];

System.out.println(sum);

static void mainDiagonal(int[][] a) {

for(int k=0;k<a.length;k++)

System.out.printf("%2d\t",a[k][k]);

System.out.println();

static void sumBelowDiagonal(int[][] a) {

int sum=0;
 for(int k=0;k<a.length;k++) {

for(int d=0;d<a[k].length;d++)

if(k>d) {

sum+=a[k][d];

System.out.println(sum);

static void sumAboveDiagonal(int[][] a) {

int sum=0;

for(int k=0;k<a.length;k++) {

for(int d=0;d<a[k].length;d++)

if(k<d) {

sum+=a[k][d];

System.out.println(sum);

static void oddBelowDiagonal(int[][] a) {

for(int k=0;k<a.length;k++) {

for(int d=0;d<a[k].length;d++)

if(k>d && a[k][d]%2==1) {

System.out.printf("%2d\t",a[k][d]);

System.out.println();

static void evenAboveDiagonal(int[][] a) {

for(int k=0;k<a.length;k++) {
 for(int d=0;d<a[k].length;d++)

if(k<d && a[k][d]%2==0) {

System.out.printf("%2d\t",a[k][d]);

System.out.println();