[JAVA-자바] 9019번: DSLR

 

소스코드:

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;

public class Main {
    static BufferedReader br;
    static BufferedWriter bw;

    static class myClass {
        public int number;
        public String output;

        public myClass(int number, String output) {
            this.number = number;
            this.output = output;
        }
    }

    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        bw = new BufferedWriter(new OutputStreamWriter(System.out));

        char[] command = new char[]{'D', 'S', 'L', 'R'};

        int T = Integer.parseInt(br.readLine());
        for (int i = 0; i < T; i++) {
            StringTokenizer st = new StringTokenizer(br.readLine());
            int number = Integer.parseInt(st.nextToken());
            int target = Integer.parseInt(st.nextToken());

            boolean[] visited = new boolean[10000];

            Queue<myClass> queue = new LinkedList<>();
            queue.add(new myClass(number, ""));
            visited[number] = true;

            while (!queue.isEmpty()) {
                myClass cur = queue.poll();
                int cur_number = cur.number;
                String cur_output = cur.output;

                if (cur_number == target) {
                    bw.write(cur_output + "\n");
                    break;
                }

                int[] nextNumber = new int[]{D(cur_number), S(cur_number), L(cur_number), R(cur_number)};
                for (int q = 0; q < 4; q++) {
                    if (!visited[nextNumber[q]]) {
                        visited[nextNumber[q]] = true;
                        queue.add(new myClass(nextNumber[q], cur_output + command[q]));
                    }
                }
            }
        }
        br.close();
        bw.close();
    }

    public static int D(int n) {
        return (n * 2) % 10000;
    }

    public static int S(int n) {
        if (n == 0) {
            return 9999;
        }
        return n - 1;
    }

    public static int L(int n) {
        return ((n % 1000) * 10) + (n / 1000);
    }

    public static int R(int n) {
        return (n / 10) + ((n % 10) * 1000);
    }

}

 

글의 내용 중 잘못된 점이나 수정이 필요한 부분, 혹은 궁금한 사항이 있다면 언제든 댓글로 남겨주시면 감사하겠습니다.

여러분의 피드백은 더 나은 글을 작성하는 데 큰 도움이 됩니다. 감사합니다.