結果
問題 | No.782 マイナス進数 |
ユーザー | kusomushi |
提出日時 | 2019-07-10 19:25:51 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 180 ms / 2,000 ms |
コード長 | 4,967 bytes |
コンパイル時間 | 3,680 ms |
コンパイル使用メモリ | 74,840 KB |
実行使用メモリ | 55,820 KB |
最終ジャッジ日時 | 2023-08-05 23:06:02 |
合計ジャッジ時間 | 10,125 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
47,520 KB |
testcase_01 | AC | 44 ms
49,392 KB |
testcase_02 | AC | 145 ms
55,344 KB |
testcase_03 | AC | 149 ms
55,248 KB |
testcase_04 | AC | 162 ms
55,072 KB |
testcase_05 | AC | 146 ms
55,184 KB |
testcase_06 | AC | 149 ms
55,672 KB |
testcase_07 | AC | 158 ms
55,820 KB |
testcase_08 | AC | 142 ms
55,096 KB |
testcase_09 | AC | 140 ms
55,220 KB |
testcase_10 | AC | 140 ms
55,256 KB |
testcase_11 | AC | 145 ms
54,980 KB |
testcase_12 | AC | 141 ms
54,824 KB |
testcase_13 | AC | 168 ms
55,552 KB |
testcase_14 | AC | 150 ms
55,352 KB |
testcase_15 | AC | 156 ms
54,860 KB |
testcase_16 | AC | 155 ms
55,052 KB |
testcase_17 | AC | 161 ms
55,656 KB |
testcase_18 | AC | 154 ms
55,196 KB |
testcase_19 | AC | 162 ms
55,060 KB |
testcase_20 | AC | 152 ms
55,316 KB |
testcase_21 | AC | 168 ms
54,960 KB |
testcase_22 | AC | 164 ms
55,032 KB |
testcase_23 | AC | 145 ms
55,196 KB |
testcase_24 | AC | 180 ms
55,048 KB |
testcase_25 | AC | 158 ms
55,032 KB |
testcase_26 | AC | 162 ms
55,560 KB |
testcase_27 | AC | 157 ms
52,932 KB |
testcase_28 | AC | 158 ms
55,248 KB |
testcase_29 | AC | 41 ms
49,412 KB |
testcase_30 | AC | 42 ms
49,452 KB |
testcase_31 | AC | 43 ms
49,380 KB |
testcase_32 | AC | 45 ms
49,380 KB |
testcase_33 | AC | 42 ms
49,496 KB |
testcase_34 | AC | 42 ms
49,500 KB |
testcase_35 | AC | 43 ms
49,412 KB |
testcase_36 | AC | 44 ms
49,588 KB |
testcase_37 | AC | 43 ms
49,376 KB |
ソースコード
import java.io.*; import java.util.Arrays; import java.util.StringJoiner; import java.util.StringTokenizer; public class Main { static int T, B; static int[] N; public static void main(String[] args) { FastScanner sc = new FastScanner(System.in); T = sc.nextInt(); B = sc.nextInt(); N = sc.nextIntArray(T); PrintWriter pw = new PrintWriter(System.out); solve(pw); pw.flush(); } static void solve(PrintWriter pw) { long cur = 0; for (int i = 0; i < T; i++) { int n = N[i]; if( n == 0 ) { pw.println(0); continue; } StringBuilder b = new StringBuilder(); while(n != 0) { int r = n % B; if( r < 0 ) r += Math.abs(B); n -= r; b.append(r); n = n/B; } pw.println(b.reverse().toString()); } } @SuppressWarnings("unused") static class FastScanner { private BufferedReader reader; private StringTokenizer tokenizer; FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } long nextLong() { return Long.parseLong(next()); } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } int[] nextIntArray(int n, int delta) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt() + delta; return a; } long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } } static void writeLines(int[] as) { PrintWriter pw = new PrintWriter(System.out); for (int a : as) pw.println(a); pw.flush(); } static void writeLines(long[] as) { PrintWriter pw = new PrintWriter(System.out); for (long a : as) pw.println(a); pw.flush(); } static void writeSingleLine(int[] as) { PrintWriter pw = new PrintWriter(System.out); for (int i = 0; i < as.length; i++) { if (i != 0) pw.print(" "); pw.print(as[i]); } pw.println(); pw.flush(); } static int max(int... as) { int max = Integer.MIN_VALUE; for (int a : as) max = Math.max(a, max); return max; } static int min(int... as) { int min = Integer.MAX_VALUE; for (int a : as) min = Math.min(a, min); return min; } static void debug(Object... args) { StringJoiner j = new StringJoiner(" "); for (Object arg : args) { if (arg == null) j.add("null"); else if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg)); else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg)); else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg)); else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg)); else j.add(arg.toString()); } System.err.println(j.toString()); } static void printSingleLine(int[] array) { PrintWriter pw = new PrintWriter(System.out); for (int i = 0; i < array.length; i++) { if (i != 0) pw.print(" "); pw.print(array[i]); } pw.println(); pw.flush(); } static int lowerBound(int[] array, int value) { int lo = 0, hi = array.length, mid; while (lo < hi) { mid = (hi + lo) / 2; if (array[mid] < value) lo = mid + 1; else hi = mid; } return lo; } static int upperBound(int[] array, int value) { int lo = 0, hi = array.length, mid; while (lo < hi) { mid = (hi + lo) / 2; if (array[mid] <= value) lo = mid + 1; else hi = mid; } return lo; } }