Repository navigation
Expand file tree
/
Copy pathSolution.java
More file actions
157 lines (128 loc) · 3.72 KB
/
Copy pathSolution.java
File metadata and controls
157 lines (128 loc) · 3.72 KB
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
import java.io.*;
import java.util.*;
public class Solution {
static FastScanner sc;
static PrintWriter out;
// Toggle file I/O: true = use files, false = use console
static final boolean USE_FILE_IO = false;
public static void solve() {
// Write your solution here
}
public static void main(String[] args) {
try {
if (USE_FILE_IO) {
sc = new FastScanner(new FileInputStream("input.txt"));
out = new PrintWriter(new FileOutputStream("output.txt"));
} else {
sc = new FastScanner(System.in);
out = new PrintWriter(System.out);
}
int t = 1;
// t = sc.nextInt();
while (t-- > 0) {
solve();
}
out.close();
} catch (IOException e) {
e.printStackTrace();
}
}
// Helper methods for printing
static void print(Object x) {
out.print(x);
}
static void println(Object x) {
out.println(x);
}
static void println() {
out.println();
}
static void printArray(int[] arr) {
for (int i = 0; i < arr.length; i++) {
out.print(arr[i] + (i == arr.length - 1 ? "" : " "));
}
out.println();
}
static void printArray(long[] arr) {
for (int i = 0; i < arr.length; i++) {
out.print(arr[i] + (i == arr.length - 1 ? "" : " "));
}
out.println();
}
// Helper methods for max/min
static int max(int... values) {
int max = Integer.MIN_VALUE;
for (int v : values) max = Math.max(max, v);
return max;
}
static long max(long... values) {
long max = Long.MIN_VALUE;
for (long v : values) max = Math.max(max, v);
return max;
}
static int min(int... values) {
int min = Integer.MAX_VALUE;
for (int v : values) min = Math.min(min, v);
return min;
}
static long min(long... values) {
long min = Long.MAX_VALUE;
for (long v : values) min = Math.min(min, v);
return min;
}
static int maxArray(int[] arr) {
int max = Integer.MIN_VALUE;
for (int v : arr) max = Math.max(max, v);
return max;
}
static long maxArray(long[] arr) {
long max = Long.MIN_VALUE;
for (long v : arr) max = Math.max(max, v);
return max;
}
static int minArray(int[] arr) {
int min = Integer.MAX_VALUE;
for (int v : arr) min = Math.min(min, v);
return min;
}
static long minArray(long[] arr) {
long min = Long.MAX_VALUE;
for (long v : arr) min = Math.min(min, v);
return min;
}
static class FastScanner {
BufferedReader br;
StringTokenizer st = new StringTokenizer("");
FastScanner(InputStream in) {
br = new BufferedReader(new InputStreamReader(in));
}
String next() {
while (!st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}