結果
問題 | No.600 かい文回 |
ユーザー | tanzaku |
提出日時 | 2017-11-24 23:38:36 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 124 ms / 2,000 ms |
コード長 | 4,277 bytes |
コンパイル時間 | 1,999 ms |
コンパイル使用メモリ | 77,916 KB |
実行使用メモリ | 40,960 KB |
最終ジャッジ日時 | 2024-11-27 08:29:53 |
合計ジャッジ時間 | 4,976 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
37,256 KB |
testcase_01 | AC | 77 ms
37,884 KB |
testcase_02 | AC | 100 ms
40,408 KB |
testcase_03 | AC | 112 ms
40,960 KB |
testcase_04 | AC | 78 ms
38,000 KB |
testcase_05 | AC | 104 ms
40,660 KB |
testcase_06 | AC | 110 ms
40,560 KB |
testcase_07 | AC | 107 ms
40,652 KB |
testcase_08 | AC | 113 ms
40,672 KB |
testcase_09 | AC | 102 ms
40,248 KB |
testcase_10 | AC | 112 ms
40,688 KB |
testcase_11 | AC | 124 ms
40,796 KB |
testcase_12 | AC | 112 ms
40,680 KB |
testcase_13 | AC | 110 ms
40,532 KB |
testcase_14 | AC | 111 ms
40,836 KB |
testcase_15 | AC | 48 ms
37,092 KB |
testcase_16 | AC | 109 ms
40,720 KB |
testcase_17 | AC | 90 ms
38,872 KB |
testcase_18 | AC | 100 ms
40,168 KB |
testcase_19 | AC | 79 ms
38,288 KB |
testcase_20 | AC | 91 ms
40,148 KB |
ソースコード
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.io.IOException; import java.io.BufferedReader; import java.io.Reader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; MyInput in = new MyInput(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskD solver = new TaskD(); solver.solve(1, in, out); out.close(); } static class TaskD { public void solve(int testNumber, MyInput in, PrintWriter out) { int n = in.nextInt(); if (n == 1) { out.println("a"); return; } String ans = rec(n, 'a'); StringBuilder sb = new StringBuilder(ans); sb.reverse(); out.println(ans + sb.toString()); } String rec(int idx, char c) { if (c > 'z') c = 'a'; if (idx == 2) { return c + ""; } if (idx == 3) { return c + "" + (char) (c + 1); } if (idx % 2 == 1) { String s = rec(idx / 2, (char) (c + 1)); return c + "" + s.charAt(0) + s; } else { String s = rec(idx / 2, c); return s.charAt(0) + s; } } } static class MyInput { private final BufferedReader in; private static int pos; private static int readLen; private static final char[] buffer = new char[1024 * 8]; private static char[] str = new char[500 * 8 * 2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for (int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public MyInput(InputStream is) { in = new BufferedReader(new InputStreamReader(is)); } public int read() { if (pos >= readLen) { pos = 0; try { readLen = in.read(buffer); } catch (IOException e) { throw new RuntimeException(); } if (readLen <= 0) { throw new MyInput.EndOfFileRuntimeException(); } } return buffer[pos++]; } public int nextInt() { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if (str[0] == '-') { i = 1; } for (; i < len; i++) ret = ret * 10 + str[i] - '0'; if (str[0] == '-') { ret = -ret; } return ret; } public char nextChar() { while (true) { final int c = read(); if (!isSpace[c]) { return (char) c; } } } int reads(int len, boolean[] accept) { try { while (true) { final int c = read(); if (accept[c]) { break; } if (str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char) c; } } catch (MyInput.EndOfFileRuntimeException e) { } return len; } static class EndOfFileRuntimeException extends RuntimeException { } } }