-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q14888.java
58 lines (47 loc) · 1.75 KB
/
Q14888.java
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
package forRank;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
public class Q14888 {
private static int max;
private static int min;
private static int N;
private static int numbers[];
private static void solution(int index, int sum, int plus, int minus, int mult, int div){
if(index == N){
max = Math.max(max, sum);
min = Math.min(min, sum);
}
if(plus > 0)
solution(index + 1, sum + numbers[index], plus - 1, minus, mult, div);
if(minus > 0)
solution(index + 1, sum - numbers[index], plus, minus - 1, mult, div);
if(mult > 0)
solution(index + 1, sum * numbers[index], plus, minus, mult - 1, div);
if(div > 0)
solution(index + 1, sum / numbers[index], plus, minus, mult, div - 1);
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
max = -Integer.MAX_VALUE + 1;
min = Integer.MAX_VALUE;
N = Integer.parseInt(br.readLine());
numbers = new int[N];
StringTokenizer st = new StringTokenizer(br.readLine());
for (int i = 0; i < N; i++)
numbers[i] = Integer.parseInt(st.nextToken());
st = new StringTokenizer(br.readLine());
int plus = Integer.parseInt(st.nextToken());
int minus = Integer.parseInt(st.nextToken());
int mult = Integer.parseInt(st.nextToken());
int div = Integer.parseInt(st.nextToken());
solution(1, numbers[0], plus, minus, mult, div);
bw.write(String.format("%d\n%d\n", max, min));
br.close();
bw.close();
}
}