forked from shikaruki/Hactoberfest2021
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ExitPointOfMatrix.java
89 lines (67 loc) · 1.24 KB
/
ExitPointOfMatrix.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
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);
}
}