結果
問題 | No.428 小数から逃げる夢 |
ユーザー | kitakitalily |
提出日時 | 2019-04-25 14:27:00 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,086 bytes |
コンパイル時間 | 3,256 ms |
コンパイル使用メモリ | 77,728 KB |
実行使用メモリ | 60,796 KB |
最終ジャッジ日時 | 2024-11-19 04:27:06 |
合計ジャッジ時間 | 19,076 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | WA | - |
testcase_76 | WA | - |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | WA | - |
testcase_83 | WA | - |
testcase_84 | WA | - |
testcase_85 | WA | - |
testcase_86 | WA | - |
testcase_87 | WA | - |
testcase_88 | WA | - |
testcase_89 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
testcase_92 | WA | - |
testcase_93 | WA | - |
testcase_94 | WA | - |
testcase_95 | WA | - |
testcase_96 | WA | - |
testcase_97 | WA | - |
testcase_98 | WA | - |
testcase_99 | WA | - |
ソースコード
import java.util.*;public class Main {static int mod = 1000000007;static int size = 200000;static long[] fac = new long[size];static long[] finv = new long[size];static long[] inv = new long[size];static int INF = Integer.MAX_VALUE;public static void main(String[] args){Scanner scanner = new Scanner(System.in);double n = scanner.nextDouble();double d = 0.1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991;System.out.println(d*n);}static class Pair implements Comparable<Pair>{int x, y;Pair(int a, int b){x = a;y = b;}@Overridepublic boolean equals(Object o){if (this == o) return true;if (!(o instanceof Pair)) return false;Pair p = (Pair) o;return x == p.x && y == p.y;}@Overridepublic int compareTo(Pair p){//return x == p.x ? y - p.y : x - p.x; //xで昇順にソート//return (x == p.x ? y - p.y : x - p.x) * -1; //xで降順にソート//return y == p.y ? x - p.x : y - p.y;//yで昇順にソートreturn (y == p.y ? x - p.x : y - p.y)*-1;//yで降順にソート}}static class E{int to;E(int to){this.to = to;}}static class Edge implements Comparable<Edge>{int from;int to;int cost;Edge(int from, int to,int cost){this.from = from;this.to = to;this.cost = cost;}public int compareTo(Edge e) {return this.cost - e.cost;}}//繰り返し二乗法public static long pow(long x, long n){long ans = 1;while(n > 0){if((n & 1) == 1){ans = ans * x;ans %= mod;}x = x * x % mod;n >>= 1;}return ans;}//fac, inv, finvテーブルの初期化、これ使う場合はinitComb()で初期化必要public static void initComb(){fac[0] = finv[0] = inv[0] = fac[1] = finv[1] = inv[1] = 1;for (int i = 2; i < size; ++i) {fac[i] = fac[i - 1] * i % mod;inv[i] = mod - (mod / i) * inv[(int) (mod % i)] % mod;finv[i] = finv[i - 1] * inv[i] % mod;}}//nCk % modpublic static long comb(int n, int k){return fac[n] * finv[k] % mod * finv[n - k] % mod;}//n! % modpublic static long fact(int n){return fac[n];}//(n!)^-1 with % modpublic static long finv(int n){return finv[n];}static class UnionFind {int[] parent;public UnionFind(int size) {parent = new int[size];Arrays.fill(parent, -1);}public boolean unite(int x, int y) {x = root(x);y = root(y);if (x != y) {if (parent[y] < parent[x]) {int tmp = y;y = x;x = tmp;}parent[x] += parent[y];parent[y] = x;return true;}return false;}public boolean same(int x, int y) {return root(x) == root(y);}public int root(int x) {return parent[x] < 0 ? x : (parent[x] = root(parent[x]));}public int size(int x) {return -parent[root(x)];}}public static int upperBound(long[] a,long val){return upperBound(a,0,a.length,val);}public static int upperBound(long[] a,int l,int r,long val){if(r-l==1){if(a[l]>val) return l;return r;}int mid=(l+r)/2;if(a[mid]>val){return upperBound(a,l,mid,val);}else{return upperBound(a,mid,r,val);}}public static int lowerBound(long[] a,long val){return lowerBound(a,0,a.length,val);}public static int lowerBound(long[] a,int l,int r,long val){if(r-l==1){if(a[l]<val) return r;return l;}int mid=(l+r)/2;if(a[mid]<val){return lowerBound(a,mid,r,val);}else{return lowerBound(a,l,mid,val);}}//n,mの最大公約数public static int gcd(int n, int m){if(m > n) return gcd(m,n);if(m == 0) return n;return gcd(m, n%m);}}