結果
問題 | No.756 チャンパーノウン定数 (1) |
ユーザー | Suunn |
提出日時 | 2019-02-21 03:09:18 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 51 ms / 2,000 ms |
コード長 | 2,957 bytes |
コンパイル時間 | 2,177 ms |
コンパイル使用メモリ | 76,512 KB |
実行使用メモリ | 36,928 KB |
最終ジャッジ日時 | 2024-11-08 18:52:07 |
合計ジャッジ時間 | 4,285 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
36,412 KB |
testcase_01 | AC | 49 ms
36,712 KB |
testcase_02 | AC | 49 ms
36,928 KB |
testcase_03 | AC | 48 ms
36,440 KB |
testcase_04 | AC | 51 ms
36,696 KB |
testcase_05 | AC | 48 ms
36,640 KB |
testcase_06 | AC | 49 ms
36,468 KB |
testcase_07 | AC | 47 ms
36,588 KB |
testcase_08 | AC | 49 ms
36,516 KB |
testcase_09 | AC | 48 ms
36,644 KB |
testcase_10 | AC | 48 ms
36,896 KB |
testcase_11 | AC | 47 ms
36,308 KB |
testcase_12 | AC | 49 ms
36,612 KB |
testcase_13 | AC | 49 ms
36,348 KB |
testcase_14 | AC | 49 ms
36,340 KB |
testcase_15 | AC | 49 ms
36,468 KB |
testcase_16 | AC | 50 ms
36,728 KB |
testcase_17 | AC | 49 ms
36,812 KB |
testcase_18 | AC | 48 ms
36,676 KB |
testcase_19 | AC | 49 ms
36,748 KB |
testcase_20 | AC | 49 ms
36,752 KB |
testcase_21 | AC | 49 ms
36,716 KB |
testcase_22 | AC | 49 ms
36,768 KB |
ソースコード
import java.io.IOException; import java.util.NoSuchElementException; public class Main{ public static void main(String[] args){ FastScanner sc = new FastScanner(); String S= "0123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960"; int D = sc.nextInt(); System.out.println(S.charAt(D)); } } class FastScanner { private final java.io.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 static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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() { 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 (int) (minus ? -n : n); }else{ throw new NumberFormatException(); } b = readByte(); } } }