This repository was archived by the owner on Feb 7, 2026. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTestWriter.java
More file actions
141 lines (118 loc) · 3.51 KB
/
Copy pathTestWriter.java
File metadata and controls
141 lines (118 loc) · 3.51 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
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.nio.file.Paths;
public class TestWriter {
private static final String POSITIVE_ANS = "Yes";
private static final String NEGATIVE_ANS = "No";
public static void main(String... args) throws IOException {
String dir = args[0];
String name = args[1];
int n = Integer.parseInt(name);
File in = Paths.get(dir, name + ".in").toFile();
BufferedWriter iw = new BufferedWriter(new FileWriter(in, false));
File out = Paths.get(dir, name + ".out").toFile();
BufferedWriter ow = new BufferedWriter(new FileWriter(out, false));
iw.write(String.valueOf(n));
iw.write("\n");
int[] a = new int[n];
fillNaturalOrder(a);
printArray(iw, a);
printAnswer(ow, POSITIVE_ANS);
fillReversedNaturalOrder(a);
printArray(iw, a);
printAnswer(ow, POSITIVE_ANS);
fillRestInIncorrectOrder(a);
printArray(iw, a);
printAnswer(ow, NEGATIVE_ANS);
bufferOddValuesInCorrectOrder(a);
printArray(iw, a);
printAnswer(ow, POSITIVE_ANS);
bufferOddValuesInNaturalOrder(a);
printArray(iw, a);
printAnswer(ow, NEGATIVE_ANS);
severalPushOnePop(a);
printArray(iw, a);
printAnswer(ow, POSITIVE_ANS);
iw.write("0\n");
iw.write("0");
iw.close();
ow.close();
}
private static void printAnswer(BufferedWriter w, String answer) throws IOException {
w.write(answer + "\n");
}
private static void printArray(BufferedWriter w, int[] a) throws IOException {
for (int value : a) {
w.write(String.valueOf(value));
w.write(" ");
}
w.newLine();
}
// 1 2 3 4 5
private static void fillNaturalOrder(int[] a) {
for (int i = 0; i < a.length; i++) {
a[i] = i + 1;
}
}
// 5 4 3 2 1
private static void fillReversedNaturalOrder(int[] a) {
for (int i = 0; i < a.length; i++) {
a[i] = a.length - i;
}
}
// 5 4 3 1 2
private static void fillRestInIncorrectOrder(int[] a) {
int n = a.length;
int half = n / 2;
for (int i = 0; i < half; i++) {
a[i] = n - i;
}
for (int i = half; i < n; i++) {
a[i] = i - half + 1;
}
}
// 2 4 5 3 1
private static void bufferOddValuesInCorrectOrder(int[] a) {
int n = a.length;
int half = n / 2;
int shift = n % 2 == 0 ? -1 : 0;
for (int i = 0; i < half; i++) {
a[i] = 2 * (i + 1);
a[i + half] = n - 2 * i + shift;
}
if (n % 2 == 1) {
a[n - 1] = 1;
}
}
// 2 4 1 3 5
private static void bufferOddValuesInNaturalOrder(int[] a) {
int n = a.length;
int half = n / 2;
for (int i = 0; i < half; i++) {
a[i] = 2 * (i + 1);
a[i + half] = 2 * i + 1;
}
if (n % 2 == 1) {
a[n - 1] = n;
}
}
// 3 6 9 8 7 5 4 2 1
private static void severalPushOnePop(int[] a) {
int n = a.length;
int c = 3;
int k = n / c;
for (int i = 0; i < k; i++) {
a[i] = (i + 1) * c;
}
int s = n;
for (int i = k; i < n; i++) {
if (s % c == 0) {
s--;
}
a[i] = s;
s--;
}
}
}