-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
89 lines (79 loc) · 2.49 KB
/
Main.java
File metadata and controls
89 lines (79 loc) · 2.49 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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.*;
public class Main {
static List<Integer> result = new ArrayList<>();
static int N;
static long Maxtotal=Long.MIN_VALUE;
static long Mintotal=Long.MAX_VALUE;
public static void main(String[] args) throws IOException {
BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
N=Integer.parseInt(br.readLine());
String [] ex=br.readLine().split(" ");
int [] numbers = new int[10];
int [] tmpArr =new int[N+1];
recursion(numbers,tmpArr,ex,0);
String maxV =String.valueOf(Maxtotal);
String minV =String.valueOf(Mintotal);
if(maxV.length()<N+1){
String tmp0="";
for (int i = 0; i < (N+1)-maxV.length() ; i++) {
tmp0+="0";
}
maxV=tmp0+maxV;
}
if(minV.length()<N+1){
String tmp0="";
for (int i = 0; i < (N+1)-minV.length() ; i++) {
tmp0+="0";
}
minV=tmp0+minV;
}
System.out.println(maxV);
System.out.println(minV);
}
private static void recursion(int[] numbers, int[] tmpArr, String[] ex, int r) {
if(r==N+1){
if(comparingNumber(tmpArr, ex)){
long place =1;
long tmpsum=0;
for (int i = tmpArr.length-1 ; i >=0 ; i--) {
tmpsum+= (tmpArr[i]*place);
place*=10;
}
Maxtotal=Math.max(Maxtotal,tmpsum);
Mintotal=Math.min(Mintotal,tmpsum);
}
return;
}
for (int i = 0; i <= 9; i++) {
if(numbers[i]==0){
numbers[i]=1;
tmpArr[r]=i;
recursion(numbers,tmpArr, ex, r+1);
numbers[i]=0;
}
}
}
private static boolean comparingNumber(int[] numbers, String[] ex) {
int exIdx=0;
result.clear();
for (int i = 1; i < numbers.length; i++) {
int tmpA=numbers[i-1];
int tmpB=numbers[i];
if(ex[exIdx].equals("<")){
if(!(tmpA<tmpB)){
return false;
}
}else {
if(!(tmpA>tmpB)){
return false;
}
}
exIdx+=1;
}
return true;
}
}