-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathMain.java
More file actions
131 lines (106 loc) · 3.02 KB
/
Main.java
File metadata and controls
131 lines (106 loc) · 3.02 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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
private static final int MOD = (int) Math.pow(10, 9);
private static final int[][] DIRS = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
public static void main(String[] args) {
FastReader sc = new FastReader();
System.exit(0);
}
static private void swap(int[] nums, int x, int y) {
int tmp = nums[x];
nums[x] = nums[y];
nums[y] = tmp;
}
static private void reverse(int[] nums, int left, int right) {
while (left < right) {
swap(nums, left, right);
left++;
right--;
}
}
static private boolean findNextPermutation(int[] nums) {
if (nums.length <= 1) {
return false;
}
int last = nums.length - 2;
while (last >= 0) {
if (nums[last] < nums[last + 1]){
break;
}
last--;
}
if (last < 0) { return false; }
int nextGenerater = nums.length - 1;
for (int i = nums.length - 1; i > last; i--) {
if (nums[i] > nums[last]) {
nextGenerater = i;
break;
}
}
swap(nums, nextGenerater, last);
reverse(nums, last + 1, nums.length - 1);
return true;
}
static private int[] generateNArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = i + 1;
}
return res;
}
static private void print(String s) {
System.out.println(s);
}
static private void printArray(int[] e) {
for (int s: e) {
System.out.print(s + " ");
}
print("");
}
static private int log2(int x) {
return (int)(Math.log(x) / Math.log(2));
}
static private long gcd(long m, long n) {
if (m < n) { return gcd(n, m); }
if (m % n == 0) { return n; }
return gcd(n, m%n);
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
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;
}
}
}