티스토리 뷰
[SWEA 5658. [모의 SW 역량테스트] 보물상자 비밀번호 URL]
[소스 코드]
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 | import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Collection; import java.util.Collections; import java.util.Deque; import java.util.HashSet; import java.util.Iterator; import java.util.LinkedList; import java.util.List; import java.util.Queue; import java.util.Set; import java.util.StringTokenizer; public class Solution { public static int N, M, tCase, K; public static LinkedList<Integer> inputArr; public static ArrayList<Integer> ansArr; public static Set<Integer> set; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); tCase = Integer.parseInt(br.readLine()); for (int t = 1; t <= tCase; t++) { StringTokenizer st = new StringTokenizer(br.readLine()); N = Integer.parseInt(st.nextToken()); K = Integer.parseInt(st.nextToken()); M = N / 4; set = new HashSet<Integer>(); inputArr = new LinkedList<Integer>(); ansArr = new ArrayList<Integer>(); String input = br.readLine(); for (int i = 0; i < input.length(); i++) { int decimal = hexToDecimal(input.charAt(i)); inputArr.add(decimal); } for (int i = 0; i <= M; i++) { solve(); } Iterator<Integer> iterator = set.iterator(); while (iterator.hasNext()) { ansArr.add(iterator.next()); } Collections.sort(ansArr); Collections.reverse(ansArr); System.out.println("#" + t +" "+ ansArr.get(K-1)); } } public static void showArr() { Iterator<Integer> iterator = inputArr.iterator(); while (iterator.hasNext()) { System.out.print(iterator.next() + " "); } System.out.println(); } public static void solve() { for (int i = 0; i < N; i+=M) { int sum = 0; for(int j = 1 ; j <= M; j++) { int num = inputArr.get(i+M-j); sum += (num << (4 * (j-1))); } set.add(sum); } int num = inputArr.get(N-1); inputArr.remove(N-1); inputArr.addFirst(num); } public static int hexToDecimal(char ch) { if (ch >= '0' && ch <= '9') return (int) (ch - '0'); else return (int) (ch - 'A' + 10); } } | cs |
'알고리즘 문제 > SW Expert Academy' 카테고리의 다른 글
[SWEA 1953번] 탈주범 검거 :: 늦깎이 IT (0) | 2019.03.13 |
---|---|
[SWEA 4012번] 요리사 :: 늦깎이 IT (0) | 2019.03.12 |
[SWEA 4008번] 숫자 만들기 :: 늦깎이 IT (0) | 2019.03.12 |
[SWEA 5656번] 벽돌 깨기 :: 늦깎이 IT (0) | 2019.02.18 |
[SWEA 1868번] 파핑파핑 지뢰찾기 :: 늦깎이 IT (0) | 2019.02.17 |
댓글