結果
問題 | No.25 有限小数 |
ユーザー | fujisu |
提出日時 | 2015-02-13 17:13:05 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 55 ms / 5,000 ms |
コード長 | 3,067 bytes |
コンパイル時間 | 2,022 ms |
コンパイル使用メモリ | 89,716 KB |
実行使用メモリ | 37,668 KB |
最終ジャッジ日時 | 2024-04-27 17:08:14 |
合計ジャッジ時間 | 4,421 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
37,472 KB |
testcase_01 | AC | 50 ms
37,432 KB |
testcase_02 | AC | 48 ms
37,272 KB |
testcase_03 | AC | 44 ms
36,524 KB |
testcase_04 | AC | 55 ms
37,228 KB |
testcase_05 | AC | 51 ms
37,572 KB |
testcase_06 | AC | 49 ms
37,592 KB |
testcase_07 | AC | 51 ms
37,264 KB |
testcase_08 | AC | 51 ms
37,476 KB |
testcase_09 | AC | 52 ms
37,468 KB |
testcase_10 | AC | 51 ms
37,344 KB |
testcase_11 | AC | 49 ms
37,316 KB |
testcase_12 | AC | 45 ms
36,960 KB |
testcase_13 | AC | 50 ms
37,444 KB |
testcase_14 | AC | 49 ms
37,256 KB |
testcase_15 | AC | 50 ms
37,668 KB |
testcase_16 | AC | 51 ms
37,572 KB |
testcase_17 | AC | 51 ms
37,248 KB |
testcase_18 | AC | 50 ms
37,468 KB |
testcase_19 | AC | 49 ms
37,468 KB |
testcase_20 | AC | 52 ms
37,620 KB |
testcase_21 | AC | 51 ms
37,592 KB |
testcase_22 | AC | 47 ms
37,092 KB |
testcase_23 | AC | 49 ms
37,360 KB |
testcase_24 | AC | 50 ms
37,184 KB |
testcase_25 | AC | 52 ms
37,620 KB |
testcase_26 | AC | 53 ms
37,600 KB |
testcase_27 | AC | 51 ms
37,460 KB |
testcase_28 | AC | 51 ms
37,592 KB |
testcase_29 | AC | 52 ms
37,188 KB |
testcase_30 | AC | 52 ms
37,316 KB |
ソースコード
import java.io.IOException; import java.math.BigDecimal; import java.util.HashSet; import java.util.InputMismatchException; public class Main { long divide(long n, long m) { if (n % m == 0) { long k = n / m; while (k % 10 == 0) { k /= 10; } return k % 10; } HashSet<Long> set = new HashSet<Long>(); long a = n / m; long d = n % m; long ret = -1; while (true) { if (d < 0) { return 10; } if (d == 0) { break; } if (set.contains(d)) { ret = -1; break; } set.add(d); n = d * 10; a = n / m; d = n % m; ret = a; } return ret; } void run() { MyScanner sc = new MyScanner(); long n = sc.nextLong(); long m = sc.nextLong(); if (n % m == 0) { if (n % m == 0) { long k = n / m; while (k % 10 == 0) { k /= 10; } System.out.println(k % 10); } } else { try { BigDecimal a = new BigDecimal("" + n).divide(new BigDecimal("" + m)); char[] c = a.toPlainString().toCharArray(); System.out.println(c[c.length - 1]); } catch (Exception e) { System.out.println(-1); } } } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------" + '\n'); } class MyScanner { int read() { try { return System.in.read(); } catch (IOException e) { throw new InputMismatchException(); } } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }