SHOW:
|
|
- or go back to the newest paste.
1 | import java.util.*; | |
2 | ||
3 | public class q4 | |
4 | { | |
5 | public static void main (String[] args) | |
6 | { | |
7 | Scanner s = new Scanner(System.in); | |
8 | ||
9 | ||
10 | String[][] grid = new String[4][4]; | |
11 | ||
12 | int counter = Integer.parseInt(s.next()); | |
13 | ||
14 | for (int i = 1; i <=counter; i++) | |
15 | { | |
16 | for (int j = 0; j < grid.length; j++) | |
17 | { | |
18 | for (int k = 0; k < grid[0].length; k++) | |
19 | { | |
20 | grid[j][k] = s.next(); | |
21 | } | |
22 | } | |
23 | ||
24 | - | //Working on the actual checking process |
24 | + | |
25 | - | /*for (int j = 0; j < grid.length; j++) |
25 | + | |
26 | for (int k = 0; k < grid[0].length; k++) | |
27 | { | |
28 | if (grid[j][k] == "X") | |
29 | - | grid[i][j] = s.next(); |
29 | + | { |
30 | if (grid[j+1][k] == "X") | |
31 | - | }*/ |
31 | + | { |
32 | if (grid[j+2][k] == "X") | |
33 | { | |
34 | if (grid[j+3][k] == "X") | |
35 | { | |
36 | System.out.println("Yes"); | |
37 | break; | |
38 | } | |
39 | } | |
40 | } | |
41 | } | |
42 | else if (grid[j][k] == "X") | |
43 | { | |
44 | if (grid[j-1][k] == "X") | |
45 | { | |
46 | if (grid[j-2][k] == "X") | |
47 | { | |
48 | if (grid[j-3][k] == "X") | |
49 | { | |
50 | System.out.println("Yes"); | |
51 | break; | |
52 | } | |
53 | } | |
54 | } | |
55 | } | |
56 | else if (grid[j][k] == "X") | |
57 | { | |
58 | if (grid[j][k+1] == "X") | |
59 | { | |
60 | if (grid[j][k+2] == "X") | |
61 | { | |
62 | if (grid[j][k+3] == "X") | |
63 | { | |
64 | System.out.println("Yes"); | |
65 | break; | |
66 | } | |
67 | } | |
68 | } | |
69 | } | |
70 | else if (grid[j][k] == "X") | |
71 | { | |
72 | if (grid[j][k-1] == "X") | |
73 | { | |
74 | if (grid[j][k-2] == "X") | |
75 | { | |
76 | if (grid[j][k-3] == "X") | |
77 | { | |
78 | System.out.println("Yes"); | |
79 | break; | |
80 | } | |
81 | } | |
82 | } | |
83 | } | |
84 | else | |
85 | System.out.println("No"); | |
86 | } | |
87 | } | |
88 | } | |
89 | } | |
90 | } |