結果
問題 | No.501 穴と文字列 |
ユーザー |
|
提出日時 | 2017-04-08 02:33:37 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 168 ms / 2,000 ms |
コード長 | 2,378 bytes |
コンパイル時間 | 2,499 ms |
コンパイル使用メモリ | 77,732 KB |
実行使用メモリ | 46,084 KB |
最終ジャッジ日時 | 2024-12-14 16:30:14 |
合計ジャッジ時間 | 5,018 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 22 |
ソースコード
import java.io.OutputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.StringTokenizer;import java.io.IOException;import java.io.BufferedReader;import java.io.InputStreamReader;import java.io.InputStream;/*** Built using CHelper plug-in* Actual solution is at the top** @author Chiaki.Hoshinomori*/public class Main {public static void main(String[] args) {InputStream inputStream = System.in;OutputStream outputStream = System.out;InputReader in = new InputReader(inputStream);PrintWriter out = new PrintWriter(outputStream);Task501 solver = new Task501();solver.solve(1, in, out);out.close();}static class Task501 {public void solve(int testNumber, InputReader in, PrintWriter out) {int n = in.nextInt();int d = in.nextInt();if (n * 2 == d) {for (int i = 0; i < n; i++) {out.printf("B");}} else if (d <= n) {for (int i = 0; i < d; i++) {out.printf("A");}for (int i = d; i < n; i++) {out.printf("C");}} else {int y = d - n;int x = n - y;for (int i = 0; i < x; i++) {out.printf("A");}for (int i = 0; i < y; i++) {out.printf("B");}}out.println();}}static class InputReader {public BufferedReader reader;public StringTokenizer tokenizer;public InputReader(InputStream stream) {reader = new BufferedReader(new InputStreamReader(stream), 32768);tokenizer = null;}public String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new StringTokenizer(reader.readLine());} catch (IOException e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}public int nextInt() {return Integer.parseInt(next());}}}