#723237 (Java21) No.1764 Square

• 問題: No.1764 Square
• ユーザー: nishi5451
• 提出日時: 2021-12-09 22:05:19
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 54 ms / 2,000 ms
• コード長: 2,846 bytes
• コンパイル時間: 2,891 ms
• コンパイル使用メモリ: 81,604 KB
• 実行使用メモリ: 50,296 KB
• 最終ジャッジ日時: 2024-07-17 14:57:03
• 合計ジャッジ時間: 3,620 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	53 ms; 49,752 KB
testcase_01	AC	53 ms; 50,296 KB
testcase_02	AC	53 ms; 49,724 KB
testcase_03	AC	53 ms; 49,872 KB
testcase_04	AC	53 ms; 49,900 KB
testcase_05	AC	54 ms; 50,156 KB
testcase_06	AC	53 ms; 50,292 KB
testcase_07	AC	54 ms; 49,836 KB

ソースコード

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

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		int k = fs.nextInt();
		List<Queue<Character>> list = new ArrayList<>();
		for(int i = 0; i < 4; i++){
			list.add(new ArrayDeque<>());
		}
		list.get(0).add('A');
		list.get(0).add('E');
		list.get(1).add('B');
		list.get(2).add('C');
		list.get(3).add('D');
		for(int i = 0; i < k; i++){
			list.get((i+1)%4).add(list.get(i%4).poll());
		}
		for(int i = 0; i < 4; i++){
			while(!list.get(i).isEmpty()){
				pw.print(list.get(i).poll());
			}
			pw.println();
		}
	
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}