PCT/QueryDiagonals.java at master · sekhonjashan/PCT · GitHub

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
90
91
92
93
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class QueryDiagonals {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
			int matrix = 0;
			String in = "";
			String res = "";
			int testcase = 0;
			int req = 0;
			Scanner sc = new Scanner(System.in);
			List<String> puzzle = new ArrayList<>();


			matrix = Integer.parseInt(sc.nextLine());

			if( matrix >=1 && matrix <=15) {

				for(int i = 0 ; i < matrix ; i++) {

					String s = sc.nextLine().toUpperCase();

					in = in + s + " ";

				}


			}
			String [] p1 = in.split(" ");

			testcase = Integer.parseInt(sc.nextLine());

			if( testcase >=1 && testcase <= matrix ) {

				for(int i = 0 ; i < testcase ; i ++) {

					req = Integer.parseInt(sc.nextLine());

						if(req ==1) {
							String r = "";
							for(int j = req-1 ; j < matrix*matrix ; j ++) {

											r = r + " " + p1[j];

								j = j + matrix;

							}
							puzzle.add(r.substring(1));
						}

						if(req !=1) {

							String r = "";
							int rett = matrix*matrix - matrix*(req-1);
						//	System.out.println(rett);
							for(int j = req-1 ; j < rett ; j ++) {

											r = r + " " + p1[j];

										j = j + matrix;
							}
							puzzle.add(r.substring(1));
							String s = "";
							for(int j = matrix*(req-1) ; j < matrix*matrix ; j ++) {

											s = s + " " + p1[j];
								j = j + matrix;
							}
							puzzle.add(s.substring(1));

						}

				}


			}

			puzzle.stream().forEach(System.out::println);


	}


}