結果
問題 | No.254 文字列の構成 |
ユーザー | 37zigen |
提出日時 | 2018-08-26 14:21:34 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 321 ms / 5,000 ms |
コード長 | 2,805 bytes |
コンパイル時間 | 3,657 ms |
コンパイル使用メモリ | 78,868 KB |
実行使用メモリ | 56,904 KB |
最終ジャッジ日時 | 2023-09-13 19:18:59 |
合計ジャッジ時間 | 9,581 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
50,544 KB |
testcase_01 | AC | 95 ms
52,544 KB |
testcase_02 | AC | 56 ms
50,524 KB |
testcase_03 | AC | 55 ms
50,724 KB |
testcase_04 | AC | 93 ms
52,400 KB |
testcase_05 | AC | 96 ms
53,052 KB |
testcase_06 | AC | 97 ms
52,684 KB |
testcase_07 | AC | 96 ms
52,604 KB |
testcase_08 | AC | 97 ms
52,420 KB |
testcase_09 | AC | 95 ms
52,536 KB |
testcase_10 | AC | 98 ms
52,688 KB |
testcase_11 | AC | 96 ms
53,316 KB |
testcase_12 | AC | 98 ms
52,940 KB |
testcase_13 | AC | 101 ms
50,820 KB |
testcase_14 | AC | 109 ms
54,784 KB |
testcase_15 | AC | 122 ms
55,872 KB |
testcase_16 | AC | 147 ms
56,180 KB |
testcase_17 | AC | 316 ms
56,252 KB |
testcase_18 | AC | 321 ms
56,528 KB |
testcase_19 | AC | 290 ms
56,652 KB |
testcase_20 | AC | 215 ms
56,048 KB |
testcase_21 | AC | 281 ms
56,256 KB |
testcase_22 | AC | 167 ms
56,268 KB |
testcase_23 | AC | 196 ms
56,004 KB |
testcase_24 | AC | 193 ms
55,928 KB |
testcase_25 | AC | 285 ms
56,540 KB |
testcase_26 | AC | 280 ms
56,608 KB |
testcase_27 | AC | 254 ms
55,952 KB |
testcase_28 | AC | 234 ms
56,264 KB |
testcase_29 | AC | 304 ms
56,720 KB |
testcase_30 | AC | 282 ms
56,904 KB |
testcase_31 | AC | 161 ms
56,152 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.Comparator; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { new Main().run(); } void run() { Scanner sc = new Scanner(); long N = sc.nextLong(); String ans = ""; long[] comb = new long[100000]; for (long i = 0; i < comb.length; ++i) { // aがi+1個,bがi個の時、 comb[(int) i] = (i + 2) * (i + 1) / 2 + (i + 1) * i / 2; } for (int i = 0; i < 27 && N > 0; ++i) { int j = 0; while (comb[j + 1] <= N) { ++j; } String a = String.valueOf((char) ('a' + 2 * i)); String b = String.valueOf((char) ('a' + 2 * i + 1)); String add = ""; for (int k = 0; k < j; ++k) { add = add + b + a; } add = add + b; ans = ans + add; N -= comb[j]; } if (N != 0) throw new AssertionError(); System.out.println(ans); } void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } } }