結果
問題 | No.428 小数から逃げる夢 |
ユーザー | uwi |
提出日時 | 2016-10-02 22:22:31 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 47 ms / 1,000 ms |
コード長 | 3,346 bytes |
コンパイル時間 | 4,038 ms |
コンパイル使用メモリ | 87,388 KB |
実行使用メモリ | 50,168 KB |
最終ジャッジ日時 | 2023-08-13 16:56:54 |
合計ジャッジ時間 | 12,032 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,696 KB |
testcase_01 | AC | 45 ms
49,736 KB |
testcase_02 | AC | 46 ms
49,812 KB |
testcase_03 | AC | 45 ms
49,584 KB |
testcase_04 | AC | 45 ms
49,784 KB |
testcase_05 | AC | 46 ms
49,656 KB |
testcase_06 | AC | 46 ms
49,840 KB |
testcase_07 | AC | 46 ms
49,728 KB |
testcase_08 | AC | 45 ms
49,828 KB |
testcase_09 | AC | 45 ms
49,860 KB |
testcase_10 | AC | 46 ms
49,932 KB |
testcase_11 | AC | 46 ms
49,972 KB |
testcase_12 | AC | 45 ms
49,768 KB |
testcase_13 | AC | 44 ms
47,936 KB |
testcase_14 | AC | 44 ms
49,824 KB |
testcase_15 | AC | 44 ms
49,904 KB |
testcase_16 | AC | 45 ms
49,728 KB |
testcase_17 | AC | 45 ms
49,772 KB |
testcase_18 | AC | 46 ms
49,760 KB |
testcase_19 | AC | 44 ms
47,740 KB |
testcase_20 | AC | 45 ms
49,732 KB |
testcase_21 | AC | 46 ms
49,756 KB |
testcase_22 | AC | 47 ms
49,720 KB |
testcase_23 | AC | 45 ms
49,648 KB |
testcase_24 | AC | 45 ms
49,972 KB |
testcase_25 | AC | 46 ms
49,772 KB |
testcase_26 | AC | 46 ms
49,608 KB |
testcase_27 | AC | 45 ms
49,672 KB |
testcase_28 | AC | 45 ms
49,608 KB |
testcase_29 | AC | 45 ms
49,596 KB |
testcase_30 | AC | 46 ms
49,736 KB |
testcase_31 | AC | 45 ms
50,148 KB |
testcase_32 | AC | 44 ms
49,768 KB |
testcase_33 | AC | 45 ms
49,784 KB |
testcase_34 | AC | 44 ms
50,084 KB |
testcase_35 | AC | 45 ms
49,764 KB |
testcase_36 | AC | 45 ms
49,764 KB |
testcase_37 | AC | 44 ms
49,592 KB |
testcase_38 | AC | 45 ms
49,828 KB |
testcase_39 | AC | 45 ms
49,632 KB |
testcase_40 | AC | 45 ms
49,712 KB |
testcase_41 | AC | 45 ms
49,588 KB |
testcase_42 | AC | 44 ms
49,708 KB |
testcase_43 | AC | 45 ms
49,588 KB |
testcase_44 | AC | 44 ms
50,168 KB |
testcase_45 | AC | 44 ms
49,584 KB |
testcase_46 | AC | 44 ms
49,668 KB |
testcase_47 | AC | 44 ms
49,764 KB |
testcase_48 | AC | 44 ms
49,624 KB |
testcase_49 | AC | 43 ms
49,700 KB |
testcase_50 | AC | 43 ms
49,688 KB |
testcase_51 | AC | 44 ms
49,600 KB |
testcase_52 | AC | 44 ms
49,696 KB |
testcase_53 | AC | 43 ms
50,008 KB |
testcase_54 | AC | 43 ms
49,740 KB |
testcase_55 | AC | 44 ms
49,932 KB |
testcase_56 | AC | 43 ms
49,940 KB |
testcase_57 | AC | 44 ms
49,692 KB |
testcase_58 | AC | 44 ms
49,884 KB |
testcase_59 | AC | 44 ms
49,716 KB |
testcase_60 | AC | 45 ms
49,960 KB |
testcase_61 | AC | 44 ms
49,620 KB |
testcase_62 | AC | 43 ms
49,600 KB |
testcase_63 | AC | 43 ms
49,840 KB |
testcase_64 | AC | 44 ms
49,752 KB |
testcase_65 | AC | 44 ms
49,748 KB |
testcase_66 | AC | 44 ms
49,936 KB |
testcase_67 | AC | 43 ms
49,668 KB |
testcase_68 | AC | 44 ms
49,832 KB |
testcase_69 | AC | 44 ms
49,964 KB |
testcase_70 | AC | 44 ms
49,704 KB |
testcase_71 | AC | 45 ms
49,652 KB |
testcase_72 | AC | 45 ms
49,800 KB |
testcase_73 | AC | 44 ms
49,600 KB |
testcase_74 | AC | 45 ms
49,696 KB |
testcase_75 | AC | 45 ms
49,748 KB |
testcase_76 | AC | 43 ms
49,592 KB |
testcase_77 | AC | 43 ms
49,752 KB |
testcase_78 | AC | 43 ms
49,836 KB |
testcase_79 | AC | 43 ms
49,812 KB |
testcase_80 | AC | 43 ms
49,692 KB |
testcase_81 | AC | 43 ms
49,808 KB |
testcase_82 | AC | 44 ms
49,716 KB |
testcase_83 | AC | 44 ms
49,628 KB |
testcase_84 | AC | 45 ms
49,688 KB |
testcase_85 | AC | 44 ms
49,828 KB |
testcase_86 | AC | 45 ms
49,736 KB |
testcase_87 | AC | 43 ms
49,780 KB |
testcase_88 | AC | 44 ms
49,788 KB |
testcase_89 | AC | 44 ms
49,668 KB |
testcase_90 | AC | 44 ms
49,652 KB |
testcase_91 | AC | 43 ms
49,740 KB |
testcase_92 | AC | 43 ms
47,940 KB |
testcase_93 | AC | 43 ms
49,728 KB |
testcase_94 | AC | 44 ms
47,868 KB |
testcase_95 | AC | 43 ms
49,832 KB |
testcase_96 | AC | 43 ms
49,656 KB |
testcase_97 | AC | 43 ms
49,724 KB |
testcase_98 | AC | 45 ms
49,688 KB |
testcase_99 | AC | 44 ms
49,756 KB |
ソースコード
package contest161002; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.math.BigDecimal; import java.util.Arrays; import java.util.InputMismatchException; public class N428 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { BigDecimal b = new BigDecimal("0.1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991"); int n = ni(); out.println(b.multiply(BigDecimal.valueOf(n))); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new N428().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }