diff --git a/ExitPointOfMatrix.java b/ExitPointOfMatrix.java new file mode 100644 index 0000000..5c80dbb --- /dev/null +++ b/ExitPointOfMatrix.java @@ -0,0 +1,89 @@ +import java.util.Scanner; + +public class ExitPointOfMatrix { + + public static void Display(int [][] a) + { + for (int i = 0; i < a.length; i++) { + for (int j = 0; j < a[0].length; j++) { + + System.out.print(a[i][j]+" "); + + } + System.out.println(); + } + } + + public static void main(String[] args) { + + Scanner scn = new Scanner(System.in); + + int row = scn.nextInt(); + int coloumn = scn.nextInt(); + + int [][] matrix = new int[row][coloumn]; + + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[0].length; j++) { + + matrix[i][j] = scn.nextInt(); + + } + } + +// Display(matrix); + + int i = 0 , j = 0 , dir = 0; + + + while(true) + { + + dir = (dir + matrix[i][j]) % 4; + + if(dir == 0) + { + j++; + } + else if(dir == 1) + { + i++; + } + else if(dir == 2) + { + j--; + } + else if(dir == 3) + { + i--; + } + + if(i < 0) + { + i++; + break; + } + else if(j < 0) + { + j++; + break; + } + else if(i == matrix.length) + { + i--; + break; + } + else if(j == matrix[0].length) + { + j--; + break; + } + + } + + System.out.println(i); + System.out.println(j); + + } + +} diff --git a/MatrixMultiplication.java b/MatrixMultiplication.java new file mode 100644 index 0000000..8816fda --- /dev/null +++ b/MatrixMultiplication.java @@ -0,0 +1,72 @@ +import java.util.Scanner; + +public class MatrixMultiplication { + + public static void Display(int [][] a) + { + for (int i = 0; i < a.length; i++) { + for (int j = 0; j < a[0].length; j++) { + + System.out.print(a[i][j]+" "); + + } + System.out.println(); + } + } + +public static void main(String[] args) { + + + + Scanner scn = new Scanner(System.in); + + int r1 = scn.nextInt(); + int c1 = scn.nextInt(); + + int [][] oneArray = new int[r1][c1]; + + for (int i = 0; i < oneArray.length; i++) { + for (int j = 0; j < oneArray[0].length; j++) { + + oneArray[i][j] = scn.nextInt(); + + } + } + + int r2 = scn.nextInt(); + int c2 = scn.nextInt(); + + int [][] twoArray = new int[r2][c2]; + + for (int i = 0; i < twoArray.length; i++) { + for (int j = 0; j < twoArray[0].length; j++) { + + twoArray[i][j] = scn.nextInt(); + + } + } + + if(c1 != r2) + { + System.out.println("Invalid input"); + return; + } + + int [][] prdArray = new int[r1][c2]; + + for (int i = 0; i < prdArray.length; i++) { + for (int j = 0; j < prdArray[0].length; j++) { + + for(int k = 0; k= minr && cnt < tne; i-- ) + { + System.out.println(spiralArray[i][j]); + cnt++; + } + + maxc--; + + for(int i = minr , j=maxc ; j >= minc && cnt < tne; j-- ) + { + System.out.println(spiralArray[i][j]); + cnt++; + } + + minr++; + + } + + } + +} + +//11 +//21 +//31 +//32 +//33 +//34 +//35 +//25 +//15 +//14 +//13 +//12 +//22 +//23 +//24 + diff --git a/TheStateOfWakanda1.java b/TheStateOfWakanda1.java new file mode 100644 index 0000000..edb0749 --- /dev/null +++ b/TheStateOfWakanda1.java @@ -0,0 +1,55 @@ +import java.util.Scanner; + +public class TheStateOfWakanda1 { + + public static void Display(int [][] a) + { + for (int i = 0; i < a.length; i++) { + for (int j = 0; j < a[0].length; j++) { + + System.out.print(a[i][j]+" "); + + } + System.out.println(); + } + } + + public static void main(String[] args) { + + Scanner scn = new Scanner(System.in); + + int row = scn.nextInt(); + int coloumn = scn.nextInt(); + + int [][] twodArray = new int[row][coloumn]; + + for (int i = 0; i < twodArray.length; i++) { + for (int j = 0; j < twodArray[0].length; j++) { + + twodArray[i][j] = scn.nextInt(); + + } + } + + for(int j = 0; j=0; i--) + { + System.out.println(twodArray[i][j]); + } + } + } + + + } + +}