結果

問題 No.1764 Square
コンテスト
ユーザー shojin_pro
提出日時 2021-11-26 22:34:07
言語 Java
(openjdk 23)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 4,159 bytes
コンパイル時間 2,283 ms
コンパイル使用メモリ 80,664 KB
実行使用メモリ 50,532 KB
最終ジャッジ日時 2024-06-29 18:12:58
合計ジャッジ時間 3,192 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 5
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        ArrayDeque<Character> dq1 = new ArrayDeque<Character>();
        ArrayDeque<Character> dq2 = new ArrayDeque<Character>();
        ArrayDeque<Character> dq3 = new ArrayDeque<Character>();
        ArrayDeque<Character> dq4 = new ArrayDeque<Character>();
        ArrayList<ArrayDeque> arr = new ArrayList<>();
        dq1.add('A');
        dq1.add('E');
        dq2.add('B');
        dq3.add('C');
        dq4.add('D');
        arr.add(dq1);
        arr.add(dq2);
        arr.add(dq3);
        arr.add(dq4);
        int k = sc.nextInt();
        for(int i = 0; i < k; i++){
            int now = i % 4;
            int next = (i+1) % 4;
            Deque<Character> dq = arr.get(now);
            Character c = dq.pollFirst();
            arr.get(next).addLast(c);
        }
        for(Deque<Character> dq : arr){
            while(dq.size() > 0){
                pw.print(dq.pollFirst());
            }
            pw.println();
        }
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0